TY - GEN
T1 - Scheduling operations and SMED
T2 - 24th International Joint Conference on Industrial Engineering and Operations Management, IJCIEOM 2018
AU - Charrua-Santos, Fernando
AU - Santos, Beatrice Paiva
AU - Calderón-Arce, Cindy
AU - Figueroa-Mata, Geovanni
AU - Lima, Tânia Miranda
N1 - Publisher Copyright:
© Springer Nature Switzerland AG 2019.
PY - 2019
Y1 - 2019
N2 - In most real cases the problem of scheduling operations are sequence dependent, that is, the setup time depends on the sequencing of tasks/batches in the machine. Given the current industrial manufacturing trends and requirements such as high variability, customization and reduction of product life cycles, organizations seek to implement new methodologies to adapt and respond with more flexibly to new demands of the global markets. Thus, this work sought to analyse, inspired by a real case of the textile industry, how production scheduling can be understood as a complement to SMED in order to achieve productivity improvement. In the case under analysis we presented the problem of scheduling tasks in uniform parallel machines with sequence-dependent setup times. The main objective of this work was to minimize the total production time. To this goal, optimization heuristics were used, in this case, simulated annealing algorithm, that demonstrated how the use of heuristics can be an advantage to reduce setup times when associated with other methodologies such as SMED.
AB - In most real cases the problem of scheduling operations are sequence dependent, that is, the setup time depends on the sequencing of tasks/batches in the machine. Given the current industrial manufacturing trends and requirements such as high variability, customization and reduction of product life cycles, organizations seek to implement new methodologies to adapt and respond with more flexibly to new demands of the global markets. Thus, this work sought to analyse, inspired by a real case of the textile industry, how production scheduling can be understood as a complement to SMED in order to achieve productivity improvement. In the case under analysis we presented the problem of scheduling tasks in uniform parallel machines with sequence-dependent setup times. The main objective of this work was to minimize the total production time. To this goal, optimization heuristics were used, in this case, simulated annealing algorithm, that demonstrated how the use of heuristics can be an advantage to reduce setup times when associated with other methodologies such as SMED.
KW - Scheduling
KW - Simulated annealing
KW - Uniform parallel machines
UR - http://www.scopus.com/inward/record.url?scp=85065503301&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-14969-7_19
DO - 10.1007/978-3-030-14969-7_19
M3 - Contribución a la conferencia
AN - SCOPUS:85065503301
SN - 9783030149680
T3 - Springer Proceedings in Mathematics and Statistics
SP - 221
EP - 227
BT - Industrial Engineering and Operations Management I - XXIV IJCIEOM 2018
A2 - Melão, Nuno
A2 - Pinelas, Sandra
A2 - Reis, João
PB - Springer New York LLC
Y2 - 18 July 2018 through 20 July 2018
ER -