×

A survey of scheduling problems with setup times or costs. (English) Zbl 1137.90474

Summary: The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by A. Allahverdi, J. N. D. Gupta and T. Aldowaisan A review of scheduling research involving setup considerations. OMEGA The International Journal of Management Sciences 27, 219–239 (1999)], who reviewed the literature since the mid-1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setup times (costs) with an average of more than 40 papers per year being added to the literature. The objective of this paper is to provide an extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers. Given that so many papers have appeared in a short time, there are cases where different researchers addressed the same problem independently, and sometimes by using even the same technique, e.g., genetic algorithm. Throughout the paper we identify such areas where independently developed techniques need to be compared. The paper classifies scheduling problems into those with batching and non-batching considerations, and with sequence-independent and sequence-dependent setup times. It further categorizes the literature according to shop environments, including single-machine, parallel machines, flow shop, no-wait flow shop, flexible flow shop, job shop, open shop, and others.

MSC:

90B35 Deterministic scheduling theory in operations research
90-02 Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming

Software:

VRP
PDFBibTeX XMLCite
Full Text: DOI Link

References:

[1] Abdekhodaee, A. H.; Wirth, A., Scheduling parallel machines with a single server: Some solvable cases and heuristics, Computers and Operations Research, 29, 295-315 (2002) · Zbl 0993.90047
[2] Abdekhodaee, A. H.; Wirth, A.; Gan, H. S., Equal processing and equal setup time cases of scheduling parallel machines with a single server, Computers and Operations Research, 31, 1867-1889 (2004) · Zbl 1068.68030
[3] Abdekhodaee, A. H.; Wirth, A.; Gan, H. S., Scheduling two parallel machines with a single server: The general case, Computers and Operations Research, 33, 994-1009 (2006) · Zbl 1079.90043
[4] Agnetis, A.; Alfieri, A.; Nicosia, G., A heuristic approach to batching and scheduling a single machine to minimize setup costs, Computers and Industrial Engineering, 46, 793-802 (2004)
[5] Akkiraju, R.; Keskinocak, P.; Murthy, S.; Wu, F., An agent-based approach for scheduling multiple machines, Applied Intelligence, 14, 135-144 (2001) · Zbl 0984.68500
[6] Al-Anzi, F.; Allahverdi, A., The relationship between three-tiered client-server internet database connectivity and two-machine flowshop, International Journal of Parallel and Distributed Systems and Networks, 4, 94-101 (2001)
[7] Al-Anzi, F.; Allahverdi, A., Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests, Journal of Mathematical Modelling and Algorithms, 4, 435-453 (2005) · Zbl 1087.68633
[8] Al-Anzi, F., Allahverdi, A., in press. A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times. European Journal of Operational Research, doi:10.1016/j.ejor.2006.09.011; Al-Anzi, F., Allahverdi, A., in press. A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times. European Journal of Operational Research, doi:10.1016/j.ejor.2006.09.011 · Zbl 1128.90024
[9] Al-Anzi, F.; Allahverdi, A., Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm, International Journal of Production Research, 44, 4701-4712 (2006) · Zbl 1114.90372
[10] Aldakhilallah, K. A.; Ramesh, R., Cyclic scheduling heuristics for a re-entrant job shop manufacturing environment, International Journal of Production Research, 39, 2635-2657 (2001) · Zbl 1060.90640
[11] Aldowaisan, T.; Allahverdi, A., Three-machine no-wait flowshop with separate setup and removal times to minimize total completion time, International Journal of Industrial Engineering, 11, 113-123 (2004)
[12] Allahverdi, A., Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times, Computers and Operations Research, 27, 111-127 (2000) · Zbl 0944.90021
[13] Allahverdi, A., Two-machine flowshop scheduling problem to minimize makespan with bounded setup and processing times, International Journal of Agile Manufacturing, 8, 145-153 (2005)
[14] Allahverdi, A., 2006a. The two-stage assembly scheduling problem to minimize makespan with setup times. In: Proceedings of the Tenth International Workshop on Project Management and Scheduling, Poznan, Poland, April 26-28, 2006, pp. 26-31.; Allahverdi, A., 2006a. The two-stage assembly scheduling problem to minimize makespan with setup times. In: Proceedings of the Tenth International Workshop on Project Management and Scheduling, Poznan, Poland, April 26-28, 2006, pp. 26-31.
[15] Allahverdi, A., Two-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times, International Journal of Production Economics, 103, 386-400 (2006)
[16] Allahverdi, A., in press. Two-machine flowshop scheduling problem to minimize maximum lateness with bounded setup and processing times. Kuwait Journal of Science and Engineering.; Allahverdi, A., in press. Two-machine flowshop scheduling problem to minimize maximum lateness with bounded setup and processing times. Kuwait Journal of Science and Engineering. · Zbl 1201.90070
[17] Allahverdi, A.; Al-Anzi, F., Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications, Computers and Operations Research, 29, 971-994 (2002) · Zbl 0995.90026
[18] Allahverdi, A.; Al-Anzi, F., A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times, European Journal of Operational Research, 169, 767-780 (2006) · Zbl 1079.90046
[19] Allahverdi, A.; Al-Anzi, F., Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times, International Journal of Production Research, 44, 4713-4735 (2006) · Zbl 1114.90373
[20] Allahverdi, A.; Aldowaisan, T., No-wait and separate setup three-machine flowshop with total completion time criterion, International Transactions in Operational Research, 7, 245-264 (2000)
[21] Allahverdi, A.; Aldowaisan, T., Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times, Journal of the Operational Research Society, 52, 449-462 (2001) · Zbl 1131.90346
[22] Allahverdi, A.; Aldowaisan, T., Two-machine flowshop to minimize total completion time with separated setup and removal times, International Journal of Industrial Engineering, 9, 275-286 (2002)
[23] Allahverdi, A.; Savsar, M., Stochastic proportionate flowshop scheduling with setups, Computers and Industrial Engineering, 39, 357-369 (2001)
[24] Allahverdi, A., Soroush, H.M., in press. The significance of reducing setup times/setup costs. European Journal of Operational Research, doi:10.1016/j.ejor.2006.09.010; Allahverdi, A., Soroush, H.M., in press. The significance of reducing setup times/setup costs. European Journal of Operational Research, doi:10.1016/j.ejor.2006.09.010 · Zbl 1137.90475
[25] Allahverdi, A.; Gupta, J. N.D.; Aldowaisan, T., A review of scheduling research involving setup considerations, OMEGA The International Journal of Management Sciences, 27, 219-239 (1999)
[26] Allahverdi, A.; Aldowaisan, T.; Sotskov, Y. N., Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times, International Journal of Mathematics and Mathematical Sciences, 39, 2475-2486 (2003) · Zbl 1041.90020
[27] Allahverdi, A.; Al-Anzi, F.; Gupta, J. N.D., A polynomial genetic based algorithm to minimize maximum lateness in a two-stage flowshop with setup times, International Journal of Operations Research, 2, 89-100 (2005) · Zbl 1115.90334
[28] Allaoui, H.; Artiba, A., Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints, Computers and Industrial Engineering, 47, 431-450 (2004)
[29] Andrés, C.; Albarracín, J. M.; Tormo, G.; Vicens, E.; García-Sabater, J. P., Group technology in a hybrid flowshop environment: A case study, European Journal of Operational Research, 167, 272-281 (2005) · Zbl 1074.90524
[30] Andrés, C., Tomás, J.V., García-Sabater, J.P., Miralles, C., 2005b. A multi-objective genetic algorithm to solve the scheduling problem in flowshops with sequence dependent setup times. In: Proceedings of the International Conference on Industrial Engineering and Systems Management, Marrakech, Morocco, May 16-19, 2005, pp. 630-635.; Andrés, C., Tomás, J.V., García-Sabater, J.P., Miralles, C., 2005b. A multi-objective genetic algorithm to solve the scheduling problem in flowshops with sequence dependent setup times. In: Proceedings of the International Conference on Industrial Engineering and Systems Management, Marrakech, Morocco, May 16-19, 2005, pp. 630-635.
[31] Anglani, A.; Grieco, A.; Guerriero, E.; Musmanno, R., Robust scheduling of parallel machines with sequence-dependent set-up costs, European Journal of Operational Research, 161, 704-720 (2005) · Zbl 1071.90526
[32] Armentano, V. A.; Mazzini, R., A genetic algorithm for scheduling on a single machine with set-up times and due dates, Production Planning and Control, 11, 713-720 (2000)
[33] Arnaout, J. P.; Rabadi, G.; Mun, J. H., A dynamic heuristic for the stochastic unrelated parallel machine scheduling problem, International Journal of Operations Research, 3, 136-143 (2006) · Zbl 1176.90257
[34] Artigues, C., Buscaylet, F., 2003. A fast tabu search method for the job-shop problem with sequence-dependent setup times. In: Proceedings of Metaheuristic International Conference, Kyoto, Japan, August 25-28, 2003, pp. 1-6.; Artigues, C., Buscaylet, F., 2003. A fast tabu search method for the job-shop problem with sequence-dependent setup times. In: Proceedings of Metaheuristic International Conference, Kyoto, Japan, August 25-28, 2003, pp. 1-6.
[35] Artigues, C.; Roubellat, F., A Petri net model and a general method for on and off-line multi-resource shop floor scheduling with setup times, International Journal of Production Economics, 74, 63-75 (2001)
[36] Artigues, C.; Roubellat, F., An efficient algorithm for operation insertion in a multi-resource job-shop scheduling with sequence-dependent setup times, Production Planning and Control, 13, 175-186 (2002)
[37] Artigues, C.; Belmokhtar, S.; Feillet, D., A new exact solution algorithm for the job shop problem with sequence-dependent setup times, (Regin, J. C.; Rueher, M., 1st International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. 1st International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Note in Computer Science, vol. 3011 (2004), Springer), 37-49 · Zbl 1094.90553
[38] Artigues, C., Lopez, P., Ayache, P., in press. Scheduling generation schemes for the job-shop problem with sequence-dependent setup times: Dominance properties and computational analysis. Annals of Operations Research.; Artigues, C., Lopez, P., Ayache, P., in press. Scheduling generation schemes for the job-shop problem with sequence-dependent setup times: Dominance properties and computational analysis. Annals of Operations Research. · Zbl 1091.90014
[39] Artigues, C., Buscaylet, F., Feillet, D., 2005. Lower and upper bounds for the job-shop scheduling problem with sequence-dependent setup times. In: Proceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications, New York, USA, July 18-21, 2005, pp. 316-321.; Artigues, C., Buscaylet, F., Feillet, D., 2005. Lower and upper bounds for the job-shop scheduling problem with sequence-dependent setup times. In: Proceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications, New York, USA, July 18-21, 2005, pp. 316-321.
[40] Asano, M.; Ohta, H., Scheduling with shutdowns and sequence dependent set-up times, International Journal of Production Research, 37, 1661-1676 (1999) · Zbl 0948.90510
[41] Aubry, A., Rossi, A., Espinouse, M.L., Jacomino, M., in press. Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint. European Journal of Operational Research, doi:10.1016/j.ejor.2006.05.050; Aubry, A., Rossi, A., Espinouse, M.L., Jacomino, M., in press. Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint. European Journal of Operational Research, doi:10.1016/j.ejor.2006.05.050 · Zbl 1137.90477
[42] Averbakh, I.; Berman, O.; Chernykh, I., A 6/5 approximation algorithm for the two-machine routing open-shop problem on a two-node network, European Journal of Operational Research, 166, 3-24 (2005) · Zbl 1069.90037
[43] Azizoglu, M.; Webster, S., Scheduling job families about an unrestricted common due date on a single machine, International Journal of Production Research, 35, 1321-1330 (1997) · Zbl 0942.90547
[44] Azizoglu, M.; Webster, S., Scheduling parallel machines to minimize weighted flowtime with family set-up times, International Journal of Production Research, 41, 1199-1215 (2003) · Zbl 1063.90025
[45] Baker, K. R., Heuristic procedures for scheduling job families with setups and due dates, Naval Research Logistics, 46, 978-991 (1999) · Zbl 0951.90026
[46] Baker, K. R.; Magazine, M. J., Minimizing maximum lateness with job families, European Journal of Operational Research, 127, 126-139 (2000) · Zbl 0991.90064
[47] Baki, M. F.; Vickson, R. G., One-operator, two-machine open shop and flow shop scheduling with setup times for machines and maximum lateness objective, INFOR, 41, 301-319 (2003) · Zbl 07682309
[48] Baki, M. F.; Vickson, R. G., One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective, Optimization Methods and Software, 19, 165-178 (2004) · Zbl 1054.90027
[49] Balakrishnan, N.; Kanet, J. J.; Sridharan, S. V., Early/tardy scheduling with sequence dependent setups on uniform parallel machines, Computers and Operations Research, 26, 127-141 (1999) · Zbl 0947.90043
[50] Balas, E., Simonetti, N., Vazacopoulos, A., 2005. Job shop scheduling with setup times, deadlines and precedence constraints. In: Proceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications, New York, USA, July 18-21, 2005, pp. 520-532.; Balas, E., Simonetti, N., Vazacopoulos, A., 2005. Job shop scheduling with setup times, deadlines and precedence constraints. In: Proceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications, New York, USA, July 18-21, 2005, pp. 520-532. · Zbl 1168.90419
[51] Ballicu, M.; Giua, A.; Seatzu, C., Job-shop scheduling models with set-up times, Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 5, 95-100 (2002)
[52] Baptiste, P., Batching identical jobs, Mathematical Methods of Operations Research, 52, 355-367 (2000) · Zbl 1023.90020
[53] Baptiste, P.; Jouglet, A., On minimizing total tardiness in a serial batching problem, RAIRO Recherche Operationnelle, 35, 107-115 (2001) · Zbl 0991.90062
[54] Baptiste, P.; Le Pape, C., Scheduling a single machine to minimize a regular objective function under setup constraints, Discrete Optimization, 2, 83-99 (2005) · Zbl 1140.90390
[55] Berning, G.; Brandenburg, M.; Gursoy, K.; Mehta, V.; Tolle, F. J., An integrated system solution for supply chain optimization in the chemical process industry, OR Spectrum, 24, 371-401 (2002) · Zbl 1028.90521
[56] Bianco, L.; Dell’Olmo, P.; Giordani, S., Flow shop no-wait scheduling with sequence dependent setup times and release dates, INFOR, 37, 3-19 (1999) · Zbl 07677574
[57] Bilge, U.; Kirac, F.; Kurtulan, M.; Pekgun, P. A., Tabu search algorithm for parallel machine total tardiness problem, Computers and Operations Research, 31, 397-414 (2004) · Zbl 1057.90516
[58] Blazewicz, J.; Kovalyov, M. Y., The complexity of two group scheduling problems, Journal of Scheduling, 5, 477-485 (2002) · Zbl 1058.90022
[59] Botta-Genoulaz, V., Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness, International Journal of Production Economics, 64, 101-111 (2000)
[60] Brown, S. I.; McGarvey, R. G.; Ventura, J. A., Flowtime and makespan for a no-wait m-machine flowshop with set-up times separated, Journal of the Operational Research Society, 55, 614-621 (2004) · Zbl 1060.90033
[61] Brucker, P.; Kovalyov, M. Y.; Shafransky, Y. M.; Werner, F., Parallel machine batch scheduling with deadlines and sequence-independent setup times, Annals of Operations Research, 83, 23-40 (1998) · Zbl 0913.90160
[62] Brucker, P.; Dhaenens-Flipo, C.; Knust, S.; Kravchenko, S. A.; Werner, F., Complexity results for parallel machine problems with a single server, Journal of Scheduling, 5, 429-457 (2002) · Zbl 1040.90016
[63] Brucker, P.; Knust, S.; Wang, G., Complexity results for flow-shop problems with a single server, European Journal of Operational Research, 165, 398-407 (2005) · Zbl 1066.90024
[64] Bukchin, J.; Masin, M., Multi-objective lot splitting for a single product m-machine flow shop line, IIE Transactions, 36, 191-202 (2004)
[65] Bukchin, J.; Tzur, M.; Jaffe, M., Lot splitting to minimize average flow-time in a two-machine flowshop, IIE Transactions, 34, 953-970 (2002)
[66] Chang, P. C.; Hsieh, J. C.; Wang, Y. W., Genetic algorithms applied in BOPP film scheduling problems: Minimizing total absolute deviation and setup times, Applied Soft Computing, 3, 139-148 (2003)
[67] Chang, T. Y.; Chou, F. D.; Lee, C. E., A heuristic algorithm to minimize total weighted tardiness on a single machine with release dates and sequence-dependent setup times, Journal of the Chinese Institute of Industrial Engineers, 21, 289-300 (2004)
[68] Chang, J., Xing, Z., Shao, H., Pei, B., 2004b. Scheduling a no-wait flowshop with separated setup and removal times. In: Proceedings of the World Congress on Intelligent Control and Automation (WCICA), vol. 4, pp. 2877-2880.; Chang, J., Xing, Z., Shao, H., Pei, B., 2004b. Scheduling a no-wait flowshop with separated setup and removal times. In: Proceedings of the World Congress on Intelligent Control and Automation (WCICA), vol. 4, pp. 2877-2880.
[69] Chang, J., Yan, W., Shao, H., 2004c. Scheduling a two-stage no-wait hybrid flowshop with separated setup and removal times. In: Proceedings of the American Control Conference, Boston, MA, United States, vol. 2, June 30-July 2, 2004, pp. 1412-1416.; Chang, J., Yan, W., Shao, H., 2004c. Scheduling a two-stage no-wait hybrid flowshop with separated setup and removal times. In: Proceedings of the American Control Conference, Boston, MA, United States, vol. 2, June 30-July 2, 2004, pp. 1412-1416.
[70] Chen, Z. L.; Powell, W. B., Exact algorithms for scheduling multiple families of jobs on parallel machines, Naval Research Logistics, 50, 823-840 (2003) · Zbl 1044.90033
[71] Chen, J. F.; Wu, T. H., Total tardiness minimization on unrelated parallel machine scheduling with auxiliary equipment constraints, Omega, 34, 81-89 (2006)
[72] Chen, D.; Li, S.; Tang, G., Single machine scheduling with common due date assignment in a group technology environment, Mathematical and Computer Modelling, 25, 81-90 (1997) · Zbl 0894.90076
[73] Cheng, T. C.E.; Kovalyov, M. Y., An exact algorithm for batching and scheduling two part types in a mixed shop: Algorithms and Complexity, International Journal of Production Economics, 55, 53-56 (1998)
[74] Cheng, T. C.E.; Kovalyov, M. Y., Parallel machine batching and scheduling with deadlines, Journal of Scheduling, 3, 109-123 (2000) · Zbl 0973.90032
[75] Cheng, T. C.E.; Kovalyov, M. Y., Single machine batch scheduling with sequential job processing, IIE Transactions, 33, 413-420 (2001)
[76] Cheng, T. C.E.; Kovalyov, M. Y., Scheduling a single server in a two-machine flow shop, Computing, 70, 167-180 (2003) · Zbl 1239.90047
[77] Cheng, T. C.E.; Chen, Z. L.; Oguz, C., One-machine batching and sequencing of 59 multiple-type items, Computers and Operations Research, 21, 717-721 (1994) · Zbl 0805.90059
[78] Cheng, T. C.E.; Chen, Z.-L.; Kovalyov, M. Y.; Lin, B. M.T., Parallel-machine batching and scheduling to minimize total completion time, IIE Transactions, 28, 953-956 (1996)
[79] Cheng, T. C.E.; Wang, G.; Sriskandarajah, C., One-operator-two-machine flowshop scheduling with setup and dismounting times, Computers and Operations Research, 26, 715-730 (1999) · Zbl 0957.90058
[80] Cheng, T. C.E.; Gupta, J. N.D.; Wang, G., A review of flowshop scheduling research with setup times, Production and Operations Management, 9, 262-282 (2000)
[81] Cheng, T. C.E.; Lin, B. M.T.; Toker, A., Makespan minimization in the two-machine flowshop batch scheduling problem, Naval Research Logistics, 47, 128-144 (2000) · Zbl 0973.90031
[82] Cheng, T. C.E.; Liu, Z.; Shafransky, Y. M., A note on the complexity of family scheduling to minimize the number of late jobs, Journal of Scheduling, 4, 225-229 (2001) · Zbl 0980.90025
[83] Cheng, T. C.E.; Janiak, A.; Kovalyov, M. Y., Single machine batch scheduling with resource dependent setup and processing times, European Journal of Operational Research, 135, 177-183 (2001) · Zbl 1077.90525
[84] Cheng, T. C.E.; Ng, C. T.; Yuan, J. J., The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard, Journal of Scheduling, 6, 483-490 (2003) · Zbl 1154.90426
[85] Cheng, T. C.E.; Ng, C. T.; Yuan, J. J., A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs, Journal of Scheduling, 6, 551-555 (2003) · Zbl 1154.90427
[86] Cheng, T. C.E.; Kovalyov, M. Y.; Chakhlevich, K. N., Batching in a two-stage flowshop with dedicated machines in the second stage, IIE Transactions, 36, 87-93 (2004)
[87] Cheung, W.; Zhou, H., Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times, Annals of Operations Research, 107, 65-81 (2001) · Zbl 1019.90050
[88] Chiu, H. N.; Chang, J. H., Cost models for lot streaming in a multistage flow shop, Omega, 33, 435-450 (2005)
[89] Cho, K. K.; Ahn, B. H., A hybrid genetic algorithm for group scheduling with sequence dependent group setup time, International Journal of Industrial Engineering: Theory Applications and Practice, 10, 442-448 (2003)
[90] Choi, I. C.; Choi, D. S., A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups, Computers and Industrial Engineering, 42, 43-58 (2002)
[91] Crama, Y.; van de Klundert, J.; Spieksma, F. C.R., Production planning problems in printed circuit board assembly, Discrete Applied Mathematics, 123, 339-361 (2002) · Zbl 1130.90325
[92] Crauwels, H. A.J.; Beullens, P.; Van Oudheusden, D., Parallel machine scheduling by family batching with sequence-dependent set-up times, International Journal of Operations Research, 3, 144-154 (2006) · Zbl 1136.90348
[93] Dang, C.; Kang, L., Batch-processing scheduling with setup times, Journal of Combinatorial Optimization, 8, 137-146 (2004) · Zbl 1058.90026
[94] Danneberg, D.; Tautenhahn, T.; Werner, F., A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size, Mathematical and Computer Modelling, 29, 101-126 (1999) · Zbl 0987.90032
[95] Demirkol, E.; Uzsoy, R., Decomposition methods for reentrant flow shops with sequence-dependent setup times, Journal of Scheduling, 3, 155-177 (2000) · Zbl 0965.90020
[96] Dileepan, P., A note on minimizing maximum lateness in a two-machine no-wait flowshop, Computers and Operations Research, 31, 2111-2115 (2004) · Zbl 1100.90508
[97] Drexl, A.; Kimms, A., Lot sizing and scheduling—Survey and extensions, European Journal of Operational Research, 99, 221-235 (1997) · Zbl 0923.90067
[98] Dunstall, S.; Wirth, A., A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines, European Journal of Operational Research, 167, 283-296 (2005) · Zbl 1074.90015
[99] Dunstall, S.; Wirth, A., Heuristic methods for the identical parallel machine flowtime problem with set-up times, Computers and Operations Research, 32, 2479-2491 (2005) · Zbl 1116.90348
[100] Dunstall, S.; Wirth, A.; Baker, K., Lower bounds and algorithms for flowtime minimization on a single machine with set-up times, Journal of Scheduling, 3, 51-69 (2000) · Zbl 0966.90031
[101] Dupuy, M., Lamothe, J., Gaborit, P., Dupont, L., 2005. Efficient neighbors in simulated annealing algorithm to optimize the lead time in a parallel multipurpose machine scheduling problem with setup and calendar constraints. In: Proceedings of the International Conference on Industrial Engineering and Systems Management, Marrakech, Morocco, May 16-19, 2005, pp. 22-31.; Dupuy, M., Lamothe, J., Gaborit, P., Dupont, L., 2005. Efficient neighbors in simulated annealing algorithm to optimize the lead time in a parallel multipurpose machine scheduling problem with setup and calendar constraints. In: Proceedings of the International Conference on Industrial Engineering and Systems Management, Marrakech, Morocco, May 16-19, 2005, pp. 22-31.
[102] Ellis, K. P.; Lu, Y.; Bish, E. K., Scheduling of wafer test processes in semiconductor manufacturing, International Journal of Production Research, 42, 215-242 (2004) · Zbl 1052.90583
[103] Eom, D. H.; Shin, H. J.; Kwun, I. H.; Shim, J. K.; Kim, S. S., Scheduling jobs on parallel machines with sequence-dependent family set-up times, International Journal of Advanced Manufacturing Technology, 19, 926-932 (2002)
[104] Eren, T.; Guner, E., A bicriteria scheduling with sequence-dependent setup times, Applied Mathematics and Computation, 179, 378-385 (2006) · Zbl 1125.90352
[105] Feng, G., Lau, H.C., 2005. Efficient algorithms for machine scheduling problems with earliness and tardiness penalties. In: Proceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications, New York, USA, July 18-21, 2005, pp. 196-211.; Feng, G., Lau, H.C., 2005. Efficient algorithms for machine scheduling problems with earliness and tardiness penalties. In: Proceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications, New York, USA, July 18-21, 2005, pp. 196-211.
[106] Focacci, F., Laborie, P., Nuijten, W., 2000. Solving scheduling problems with setup times and alternative resources. In: Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling, Breckenbridge, Colorado, USA, pp. 92-101.; Focacci, F., Laborie, P., Nuijten, W., 2000. Solving scheduling problems with setup times and alternative resources. In: Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling, Breckenbridge, Colorado, USA, pp. 92-101.
[107] Fondrevelle, J.; Allahverdi, A.; Oulamara, A., Two-machine no-wait flowshop scheduling problem to minimize maximum lateness with separate setup and removal times, International Journal of Agile Manufacturing, 8, 165-174 (2005)
[108] Fondrevelle, J., Allahverdi, A., Oulamara, A., Portmann, M.C., 2005b. Permutation flowshops with exact time lags to minimize maximum lateness. INRIA Intern Research Report, INRIA-Lorraine, Nancy, France.; Fondrevelle, J., Allahverdi, A., Oulamara, A., Portmann, M.C., 2005b. Permutation flowshops with exact time lags to minimize maximum lateness. INRIA Intern Research Report, INRIA-Lorraine, Nancy, France. · Zbl 1198.90180
[109] Fowler, J. W.; Horng, S. M.; Cochran, J. K., A hybridized genetic algorithm to solve parallel machine scheduling problems with sequence dependent setups, International Journal of Industrial Engineering: Theory Applications and Practice, 10, 232-243 (2003)
[110] França, P. M.; Mendes, A.; Moscato, P., A memetic algorithm for the total tardiness single machine scheduling problem, European Journal of Operational Research, 132, 224-242 (2001) · Zbl 0996.90042
[111] França, P. M.; Gupta, J. N.D.; Mendes, A.; Moscato, P.; Veltink, K. J., Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups, Computers and Industrial Engineering, 48, 491-506 (2005)
[112] França, P. M.; Tin, G.; Buriol, L. S., Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions, International Journal of Production Research, 44, 939-957 (2006)
[113] Gagne, C.; Price, W. L.; Gravel, M., Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times, Journal of the Operational Research Society, 53, 895-906 (2002) · Zbl 1130.90326
[114] Gambosi, G.; Nicosia, G., On-line scheduling with setup costs, Information Processing Letters, 73, 61-68 (2000) · Zbl 1339.90133
[115] Garey, M. R.; Johnson, D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Co.: W.H. Freeman and Co. San Francisco, CA · Zbl 0411.68039
[116] Gendreau, M.; Laporte, G.; Guimarães, E. M., A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times, European Journal of Operational Research, 133, 183-189 (2001) · Zbl 0989.90062
[117] Gerodimos, A. E.; Glass, C. A.; Potts, C. N.; Tautenhahn, T., Scheduling multi-operation jobs on a single machine, Annals of Operations Research, 92, 87-105 (1999) · Zbl 0931.90014
[118] Gerodimos, A. E.; Glass, C. A.; Potts, C. N., Scheduling the production of two-component jobs on a single machine, European Journal of Operational Research, 120, 250-259 (2000) · Zbl 0953.90027
[119] Gerodimos, A. E.; Glass, C. A.; Potts, C. N., Scheduling of customized jobs on a single machine under item availability, IIE Transactions, 33, 975-984 (2001)
[120] Glass, C. A.; Shafransky, Y. M.; Strusevich, V. A., Scheduling for parallel dedicated machines with a single server, Naval Research Logistics, 47, 304-328 (2000) · Zbl 0968.90036
[121] Glass, C. A.; Potts, C. N.; Strusevich, V. A., scheduling batches with sequential job processing for two-machine flow and open shops, INFORMS Journal on Computing, 13, 120-137 (2001) · Zbl 1238.90064
[122] Graham, R. L.; Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H.G., Optimization and approximation in deterministic sequencing and scheduling: A survey, Annals of Discrete Mathematics, 5, 287-326 (1979) · Zbl 0411.90044
[123] Graves, G. H.; Lee, C. Y., Scheduling maintenance and semiresumable jobs on a single machine, Naval Research Logistics, 46, 845-863 (1999) · Zbl 0931.90015
[124] Guirchoun, S., Souhkal, A., Martineau, P., 2005. Complexity results for parallel machine scheduling problems with a server in computer systems. In: Proceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications, New York, USA, July 18-21, 2005, pp. 232-236.; Guirchoun, S., Souhkal, A., Martineau, P., 2005. Complexity results for parallel machine scheduling problems with a server in computer systems. In: Proceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications, New York, USA, July 18-21, 2005, pp. 232-236.
[125] Gupta, J. N.D.; Schaller, J. E., Minimizing flow time in a flow-line manufacturing cell with family setup times, Journal of the Operational Research Society, 57, 163-176 (2006) · Zbl 1090.90082
[126] Gupta, A. K.; Sivakumar, A. I., Multi-objective scheduling of two-job families on a single machine, Omega, 33, 399-405 (2005)
[127] Gupta, S. R.; Smith, J. S., Algorithms for single machine total tardiness scheduling with sequence dependent setups, European Journal of Operational Research, 175, 722-739 (2006) · Zbl 1142.90399
[128] Hall, N. G.; Potts, C. N.; Sriskandarajah, C., Parallel machine scheduling with a common server, Discrete Applied Mathematics, 102, 223-243 (2000) · Zbl 0972.90031
[129] Hall, N. G.; Laporte, G.; Selvarajah, E.; Sriskandarajah, C., Scheduling and lot streaming in flowshops with no-wait in process, Journal of Scheduling, 6, 339-354 (2003) · Zbl 1027.90031
[130] Havill, J.T., Mao, W., in press. competitive online scheduling of perfectly malleable jobs with setup times. European Journal of Operational Research, doi:10.1016/j.ejor.2006.06.064; Havill, J.T., Mao, W., in press. competitive online scheduling of perfectly malleable jobs with setup times. European Journal of Operational Research, doi:10.1016/j.ejor.2006.06.064 · Zbl 1138.90395
[131] Heady, R. B.; Zhu, Z., Minimizing the sum of job earliness and tardiness in a multimachine system, International Journal of Production Research, 36, 1619-1632 (1998) · Zbl 0940.90504
[132] Hiraishi, K.; Levner, E.; Vlach, M., Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs, Computers and Operations Research, 29, 841-848 (2002) · Zbl 0999.68029
[133] Hochbaum, D. S.; Landy, D., Scheduling with batching: Two job types, Discrete Applied Mathematics, 72, 99-114 (1997) · Zbl 0873.90050
[134] Huang, W.; Li, S., A two-stage hybrid flowshop with uniform machines and setup times, Mathematical and Computer Modelling, 27, 27-45 (1998) · Zbl 1185.90078
[135] Hurink, J.; Knust, S., List scheduling in a parallel machine environment with precedence constraints and setup times, Operations Research Letters, 29, 231-239 (2001) · Zbl 0993.90035
[136] Hwang, H.; Sun, J. U., Production sequencing problem with reentrant work flows and sequence dependent setup times, Computers and Industrial Engineering, 33, 773-776 (1997)
[137] Hwang, H.; Sun, J. U., Production sequencing problem with re-entrant work flows and sequence dependent setup times, International Journal of Production Research, 36, 2435-2450 (1998) · Zbl 0945.90569
[138] Iravani, S. M.R.; Teo, C. P., Asymptotically optimal schedules for single-server flow shop problem with setup costs and times, Operations Research Letters, 33, 421-430 (2005) · Zbl 1090.90085
[139] Janiak, A.; Kovalyov, M. Y.; Portmann, M. C., Single machine group scheduling with resource dependent setup and processing times, European Journal of Operational Research, 162, 112-121 (2005) · Zbl 1132.90325
[140] Janiak, A., Lichtenstein, M., Oguz, C., 2006. Hybrid flow shop scheduling problem with transport times, setup times, and multiprocessor tasks. In: Proceedings of the Tenth International Workshop on Project Management and Scheduling, Poznan, Poland, April 26-28, 2006, pp. 187-192.; Janiak, A., Lichtenstein, M., Oguz, C., 2006. Hybrid flow shop scheduling problem with transport times, setup times, and multiprocessor tasks. In: Proceedings of the Tenth International Workshop on Project Management and Scheduling, Poznan, Poland, April 26-28, 2006, pp. 187-192.
[141] Jeong, B.; Kim, S. W.; Lee, Y. J., An assembly scheduler for TFT LCD manufacturing, Computers and Industrial Engineering, 41, 37-58 (2001)
[142] Jungwattanaki, J., Reodecha, M., Chaovalitwongse, P., Werner, F., 2005. An evaluation of sequencing heuristics for flexible flowshop scheduling problems with unrelated parallel machines and dual criteria. Otto-von-Guericke-Universitat Magdeburg, Preprint 28/05, pp. 1-23.; Jungwattanaki, J., Reodecha, M., Chaovalitwongse, P., Werner, F., 2005. An evaluation of sequencing heuristics for flexible flowshop scheduling problems with unrelated parallel machines and dual criteria. Otto-von-Guericke-Universitat Magdeburg, Preprint 28/05, pp. 1-23.
[143] Kalir, A. A.; Sarin, S. C., Constructing near optimal schedules for the flow-shop lot streaming problem with sublot-attached setups, Journal of Combinatorial Optimization, 7, 23-44 (2003) · Zbl 1046.90025
[144] Karabati, S.; Akkan, C., Minimizing sum of completion times on a single machine with sequence-dependent family setup times, Journal of the Operational Research Society, 57, 271-280 (2006) · Zbl 1089.90026
[145] Karimi, B.; Fatemi Ghomi, S. M.T.; Wilson, J. M., The capacitated lot sizing problem: A review of models and algorithms, Omega, 31, 365-378 (2003)
[146] Kim, S. C.; Bobrowski, P. M., Scheduling jobs with uncertain setup times and sequence dependency, Omega, 25, 437-447 (1997)
[147] Kim, S. S.; Shin, H. J., Scheduling jobs on parallel machines: A restricted tabu search approach, International Journal of Advanced Manufacturing Technology, 22, 278-287 (2003)
[148] Kim, D. W.; Kim, K. H.; Jang, W.; Chen, F. F., Unrelated parallel machine scheduling with setup times using simulated annealing, Robotics and Computer-Integrated Manufacturing, 18, 223-231 (2002)
[149] Kim, D. W.; Na, D. G.; Chen, F. F., Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective, Robotics and Computer-Integrated Manufacturing, 19, 173-181 (2003)
[150] Kim, S. S.; Shin, H. J.; Eom, D. H.; Kim, C. O., A due date density-based categorizing heuristic for parallel machines scheduling, International Journal of Advanced Manufacturing Technology, 22, 753-760 (2003)
[151] Kleinau, U., Two-machine shop scheduling problems with batch processing, Mathematical and Computer Modelling, 17, 55-66 (1993) · Zbl 0776.90037
[152] Kogan, K.; Levner, E., A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots, Computers and Operations Research, 25, 53-62 (1998) · Zbl 0907.90183
[153] Kolahan, F.; Liang, M., An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups, European Journal of Operational Research, 109, 142-159 (1998) · Zbl 0951.90025
[154] Koulamas, C. P., Scheduling two parallel semiautomatic machines to minimize machine interference, Computers and Operations Research, 23, 945-956 (1996) · Zbl 0863.90089
[155] Koulamas, C., Kyparisis, G.J., in press. Single-machine scheduling problems with past-sequence-dependent setup times. European Journal of Operational Research, doi:10.1016/j.ejor.2006.03.066; Koulamas, C., Kyparisis, G.J., in press. Single-machine scheduling problems with past-sequence-dependent setup times. European Journal of Operational Research, doi:10.1016/j.ejor.2006.03.066 · Zbl 1137.90498
[156] Kovalyov, M. Y.; Potts, C. N.; Strusevich, V. A., Batching decisions for assembly production systems, European Journal of Operational Research, 157, 620-642 (2004) · Zbl 1067.90044
[157] Kravchenko, S. A.; Werner, F., Parallel machine scheduling problems with a single server, Mathematical and Computer Modelling, 26, 1-11 (1997) · Zbl 1185.90082
[158] Kravchenko, S.A., Werner, F., 1998. Scheduling on parallel machines with a single and multiple servers. Otto-von-Guericke-Universitat Magdeburg, Preprint 30/98, pp. 1-18.; Kravchenko, S.A., Werner, F., 1998. Scheduling on parallel machines with a single and multiple servers. Otto-von-Guericke-Universitat Magdeburg, Preprint 30/98, pp. 1-18.
[159] Kravchenko, S. A.; Werner, F., A heuristic algorithm for minimizing mean flow time with unit setups, Information Processing Letters, 79, 291-296 (2001) · Zbl 1032.68026
[160] Kuik, R.; Tielemans, P. F.J., Setup utilization as a performance indicator in production planning and control, International Journal of Production Economics, 49, 175-182 (1997)
[161] Kurz, M. E.; Askin, R. G., Heuristic scheduling of parallel machines with sequence-dependent set-up times, International Journal of Production Research, 39, 3747-3769 (2001) · Zbl 1114.90355
[162] Kurz, M. E.; Askin, R. G., Comparing scheduling rules for flexible flow lines, International Journal of Production Economics, 85, 371-388 (2003)
[163] Kurz, M. E.; Askin, R. G., Scheduling flexible flow lines with sequence-dependent setup times, European Journal of Operational Research, 159, 66-82 (2004) · Zbl 1067.90045
[164] Laguna, M., A heuristic for production scheduling and inventory control in the presence of sequence-dependent setup times, IIE Transactions, 31, 125-134 (1999)
[165] Laporte, G., The vehicle routing problem: An overview of exact and approximate algorithms, European Journal of Operational Research, 59, 345-358 (1992) · Zbl 0761.90034
[166] Lee, S. M.; Asllani, A. A., Job scheduling with dual criteria and sequence-dependent setups: Mathematical versus genetic programming, Omega, 32, 145-153 (2004)
[167] Lee, Y. H.; Bhaskaran, K.; Pinedo, M., A heuristic to minimize the total weighted tardiness with sequence dependent setups, IIE Transactions, 29, 45-52 (1997)
[168] Leon, V. J.; Peters, B. A., A comparison of setup strategies for printed circuit board assembly, Computers and Industrial Engineering, 34, 219-234 (1998)
[169] Leu, B. Y., Comparative analysis of order-input sequencing heuristics in a cellular flexible assembly system for large products, International Journal of Production Research, 37, 2861-2873 (1999) · Zbl 0949.90577
[170] Leu, B. Y.; Wang, F. K., Analysis of sequencing heuristics in a flexible flow system with hybrid order shipment environments, International Journal of Industrial Engineering: Theory Applications and Practice, 7, 67-75 (2000)
[171] Leung, J.Y-T., Ng, C.T., Cheng, T.C.E., in press. Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times. European Journal of Operational Research, doi:10.1016/j.ejor.2006.03.067; Leung, J.Y-T., Ng, C.T., Cheng, T.C.E., in press. Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times. European Journal of Operational Research, doi:10.1016/j.ejor.2006.03.067 · Zbl 1138.90396
[172] Levner, E.; Kogan, K.; Maimon, O., Flowshop scheduling of robotic cells with job-dependent transportation and setup effects, Journal of the Operational Research Society, 47, 1447-1455 (1995) · Zbl 0843.90054
[173] Liaee, M. M.; Emmons, H., Scheduling families of jobs with setup times, International Journal of Production Economics, 51, 165-176 (1997)
[174] Liao, L. M.; Liao, C. J., A tabu search approach for single machine scheduling with major and minor setups, International Journal of Industrial Engineering: Theory Applications and Practice, 9, 174-183 (2002)
[175] Lin, B. M.T., Fabrication scheduling on a single machine with due date constraints, European Journal of Operational Research, 136, 95-105 (2002) · Zbl 1087.90512
[176] Lin, B. M.T.; Cheng, T. C.E., Batch scheduling in the no-wait two-machine flowshop to minimize the makespan, Computers and Operations Research, 28, 613-624 (2001) · Zbl 0990.90044
[177] Lin, B. M.T.; Cheng, T. C.E., Fabrication and assembly scheduling in a two-machine flowshop, IIE Transactions, 34, 1015-1020 (2002)
[178] Lin, B. M.T.; Cheng, T. C.E., Two-machine flowshop batching and scheduling, Annals of Operations Research, 133, 149-161 (2005) · Zbl 1119.90019
[179] Lin, B. M.T.; Jeng, A. A.K., Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs, International Journal of Production Economics, 91, 121-134 (2004)
[180] Lin, H. T.; Liao, C. J., A case study in a two-stage hybrid flow shop with setup time and dedicated machines, International Journal of Production Economics, 86, 133-143 (2003)
[181] Liu, C. Y.; Chang, S. C., Scheduling flexible flow shops with sequence-dependent setup effects, IEEE Transactions on Robotics and Automation, 16, 408-419 (2000)
[182] Liu, Z.; Cheng, T. C.E., Scheduling with job release dates, delivery times and preemption penalties, Information Processing Letters, 82, 107-111 (2002) · Zbl 1013.68028
[183] Liu, Z.; Cheng, T. C.E., Minimizing total completion time subject to job release dates and preemption penalties, Journal of Scheduling, 7, 313-327 (2004) · Zbl 1154.90471
[184] Liu, Z.; Yu, W., Minimizing the number of late jobs under the group technology assumption, Journal of Combinatorial Optimization, 3, 5-15 (1999) · Zbl 0967.90048
[185] Liu, Z.; Yu, W.; Cheng, T. C.E., Scheduling groups of unit length jobs on two identical parallel machines, Information Processing Letters, 69, 275-281 (1999) · Zbl 1040.90526
[186] Logendran, R.; Carson, S.; Hanson, E., Group scheduling in flexible flow shops, International Journal of Production Economics, 96, 143-155 (2005)
[187] Logendran, R.; de Szoeke, P.; Barnard, F., Sequence-dependent group scheduling problems in flexible flow shops, International Journal of Production Economics, 102, 66-86 (2006)
[188] Logendran, R.; Salmasi, N.; Sriskandarajah, C., Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups, Computers and Operations Research, 33, 158-180 (2006) · Zbl 1077.90530
[189] Low, C., Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines, Computers and Operations Research, 32, 2013-2025 (2005) · Zbl 1068.90060
[190] Low, C.; Hsu, C.-M.; Huang, K. I., Benefits of lot splitting in job-shop scheduling, International Journal of Advanced Manufacturing Technology, 24, 773-780 (2004)
[191] Maddux, H. S.; Gupta, J. N.D., Scheduling intermediate and finished products in a two-stage flowshop with sequence dependent setup times, Proceedings - Annual Meeting of the Decision Sciences Institute, 1579-1585 (2003)
[192] Mason, S. J.; Fowler, J. W.; Carlyle, W. M., A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops, Journal of Scheduling, 5, 247-262 (2002) · Zbl 1009.90045
[193] Mendes, A. S.; França, P. M.; Moscato, P., Fitness landscapes for the total tardiness single machine scheduling problem, Neural Network World, 12, 165-180 (2002)
[194] Mendes, A. S.; Muller, F. M.; França, P. M.; Moscato, P., Comparing meta-heuristic approaches for parallel machine scheduling problems, Production Planning and Control, 13, 143-154 (2002)
[195] Mika, M., Waligora, G., Weglarz, J., in press. Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times. European Journal of Operational Research, doi:10.1016/j.ejor.2006.06.069; Mika, M., Waligora, G., Weglarz, J., in press. Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times. European Journal of Operational Research, doi:10.1016/j.ejor.2006.06.069 · Zbl 1137.90508
[196] Miller, D. M.; Chen, H. C.; Matson, J.; Liu, Q., A hybrid genetic algorithm for the single machine scheduling problem, Journal of Heuristics, 5, 437-454 (1999) · Zbl 1071.90537
[197] Monkman, S., Morrice, D., Bard, J., in press. A production scheduling heuristic for an electronic manufacturer with sequence dependent setup costs. European Journal of Operational Research, doi:10.1016/j.ejor.2006.06.063; Monkman, S., Morrice, D., Bard, J., in press. A production scheduling heuristic for an electronic manufacturer with sequence dependent setup costs. European Journal of Operational Research, doi:10.1016/j.ejor.2006.06.063 · Zbl 1137.90509
[198] Mosheiov, G.; Oron, D., A note on flow-shop and job-shop batch scheduling with identical processing-time jobs, European Journal of Operational Research, 161, 285-291 (2005) · Zbl 1067.90049
[199] Mosheiov, G., Oron, D., in press-a. A single machine batch scheduling problem with bounded batch size. European Journal of Operational Research, doi:10.1016/j.ejor.2006.01.052; Mosheiov, G., Oron, D., in press-a. A single machine batch scheduling problem with bounded batch size. European Journal of Operational Research, doi:10.1016/j.ejor.2006.01.052 · Zbl 1137.90510
[200] Mosheiov, G., Oron, D., in press-b. Open-shop batch scheduling with identical jobs. European Journal of Operational Research, doi:10.1016/j.ejor.2006.03.068; Mosheiov, G., Oron, D., in press-b. Open-shop batch scheduling with identical jobs. European Journal of Operational Research, doi:10.1016/j.ejor.2006.03.068 · Zbl 1137.90511
[201] Mosheiov, G.; Oron, D.; Ritov, Y., Flow-shop batch scheduling with identical processing-time jobs, Naval Research Logistics, 51, 783-799 (2004) · Zbl 1075.90031
[202] Mosheiov, G.; Oron, D.; Ritov, Y., Minimizing flow-time on a single machine with integer batch sizes, Operations Research Letters, 33, 497-501 (2005) · Zbl 1195.90043
[203] Nauss, R.M., in press. Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock. European Journal of Operational Research, doi:10.1016/j.ejor.2006.06.071; Nauss, R.M., in press. Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock. European Journal of Operational Research, doi:10.1016/j.ejor.2006.06.071 · Zbl 1137.90427
[204] Nessah, F., Yalaoui, F., Chu, C., 2005. New heuristics for identical parallel machine scheduling with sequence dependent setup times and dates. In: Proceedings of the International Conference on Industrial Engineering and Systems Management, Marrakech, Morocco, May 16-19, 2005, pp. 32-41.; Nessah, F., Yalaoui, F., Chu, C., 2005. New heuristics for identical parallel machine scheduling with sequence dependent setup times and dates. In: Proceedings of the International Conference on Industrial Engineering and Systems Management, Marrakech, Morocco, May 16-19, 2005, pp. 32-41.
[205] Ng, C. T.; Cheng, T. C.E.; Yuan, J. J., A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints, Operations Research Letters, 30, 66-68 (2002) · Zbl 1030.90038
[206] Ng, C. T.; Cheng, T. C.E.; Yuan, J. J., Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem, Information Processing Letters, 82, 187-191 (2002) · Zbl 1043.90031
[207] Ng, C. T.; Cheng, T. C.E.; Kovalyov, M. Y., Batch scheduling with controllable setup and processing times to minimize total completion time, Journal of the Operational Research Society, 54, 499-506 (2003) · Zbl 1070.90044
[208] Ng, C. T.; Cheng, T. C.E.; Yuan, J. J.; Liu, Z. H., On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times, Operations Research Letters, 31, 323-326 (2003) · Zbl 1145.90392
[209] Ng, C. T.; Cheng, T. C.E.; Kovalyov, M. Y., Single machine batch scheduling with jointly compressible setup and processing times, European Journal of Operational Research, 153, 211-219 (2004) · Zbl 1137.90512
[210] Ng, C.T., Allahverdi, A., Al-Anzi, F., Cheng, T.C.E., in press. The three-machine flowshop scheduling problem to minimize maximum lateness with separate setup times. International Journal of Operational Research.; Ng, C.T., Allahverdi, A., Al-Anzi, F., Cheng, T.C.E., in press. The three-machine flowshop scheduling problem to minimize maximum lateness with separate setup times. International Journal of Operational Research. · Zbl 1154.90477
[211] Ng, C. T.; Cheng, T. C.E.; Janiak, A.; Kovalyov, M. Y., Group scheduling with controllable setup and processing times: Minimizing total weighted completion time, Annals of Operations Research, 133, 163-174 (2005) · Zbl 1119.90020
[212] Norman, B. A., Scheduling flowshops with finite buffers and sequence-dependent setup times, Computers and Industrial Engineering, 36, 163-177 (1999)
[213] Norman, B. A.; Bean, J. C., A genetic algorithm methodology for complex scheduling problems, Naval Research Logistics, 46, 199-211 (1999) · Zbl 0918.90086
[214] Pan, J. C.H.; Su, C. S., Single machine scheduling with due dates and class setups, Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers, Series A/Chung-kuo Kung Ch’eng Hsuch K’an, 20, 561-572 (1997)
[215] Pan, J. C.H.; Wu, C. C., Single machine group scheduling to minimize mean flow time subject to due date constraints, Production Planning and Control, 9, 366-370 (1998)
[216] Pan, J. C.H.; Chen, J. S.; Cheng, H. L., A heuristic approach for single-machine scheduling with due dates and class setups, Computers and Operations Research, 28, 1111-1130 (2001) · Zbl 1081.90560
[217] Park, Y.; Kim, S.; Lee, Y. H., Scheduling jobs on parallel machines applying neural network and heuristic rules, Computers and Industrial Engineering, 38, 189-202 (2000)
[218] Pearn, W. L.; Chung, S. H.; Yang, M. H., Minimizing the total machine workload for the wafer probing scheduling problem, IIE Transactions, 34, 211-220 (2002) · Zbl 1099.90543
[219] Pearn, W. L.; Chung, S. H.; Yang, M. H., The wafer probing scheduling problem (WPSP), Journal of the Operational Research Society, 53, 864-874 (2002) · Zbl 1099.90543
[220] Pearn, W. L.; Chung, S. H.; Yang, M. H.; Chen, A. Y., for the wafer probing scheduling problem with sequence-dependent set-up time and due date restrictions, Journal of the Operational Research Society, 55, 1194-1207 (2004) · Zbl 1070.90045
[221] Pearn, W. L.; Chung, S. H.; Chen, A. Y.; Yang, M. H., A case study on the multistage IC final testing scheduling problem with reentry, International Journal of Production Economics, 88, 257-267 (2004)
[222] Potts, C. N.; Kovalyov, M. Y., Scheduling with batching: A review, European Journal of Operational Research, 120, 228-349 (2000) · Zbl 0953.90028
[223] Pranzo, M., Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times, European Journal of Operational Research, 153, 581-592 (2004) · Zbl 1099.90544
[224] Pugazhendhi, S.; Thiagarajan, S.; Rajendran, C.; Anantharaman, N., Generating non-permutation schedules in flowline-based manufacturing systems with sequence-dependent setup times of jobs: A heuristic approach, The International Journal of Advanced Manufacturing Technology, 23, 64-78 (2004)
[225] Rabadi, G.; Mollaghasemi, M.; Anagnostopoulos, G. C., A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time, Computers and Operations Research, 31, 1727-1751 (2004) · Zbl 1068.90561
[226] Radhakrishnan, S.; Ventura, J. A., Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times, International Journal of Production Research, 38, 2233-2252 (2000) · Zbl 0973.90512
[227] Rajendran, C.; Ziegler, H., A heuristic for scheduling to minimize the sum of weighted flowtime of jobs in a flowshop with sequence-dependent setup times of jobs, Computers and Industrial Engineering, 33, 281-284 (1997)
[228] Rajendran, C.; Ziegler, H., Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times, European Journal of Operational Research, 149, 513-522 (2003) · Zbl 1033.90043
[229] Reddy, V.; Narendran, T. T., Heuristics for scheduling sequence-dependent set-up jobs in flow line cells, International Journal of Production Research, 41, 193-206 (2003) · Zbl 1064.90533
[230] Ríos-Mercado, R. Z.; Bard, J. F., A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times, IIE Transactions, 31, 721-731 (1999)
[231] Ríos-Mercado, R. Z.; Bard, J. F., An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times, Journal of Heuristics, 5, 53-70 (1999) · Zbl 0948.90071
[232] Ríos-Mercado, R. Z.; Bard, J. F., The flow shop scheduling polyhedron with setup times, Journal of Combinatorial Optimization, 7, 291-318 (2003) · Zbl 1053.90045
[233] Ruiz, R., Allahverdi, A., in press-a. Some effective heuristics for no-wait flowshops with setup times. Annals of Operations Research.; Ruiz, R., Allahverdi, A., in press-a. Some effective heuristics for no-wait flowshops with setup times. Annals of Operations Research. · Zbl 1145.90027
[234] Ruiz, R., Allahverdi, A., in press-b. No-wait flowshop with separate setup times to minimize maximum lateness. International Journal of Advanced Manufacturing Technology.; Ruiz, R., Allahverdi, A., in press-b. No-wait flowshop with separate setup times to minimize maximum lateness. International Journal of Advanced Manufacturing Technology.
[235] Ruiz, R.; Maroto, C., A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility, European Journal of Operational Research, 169, 781-800 (2006) · Zbl 1079.90061
[236] Ruiz, R., Stützle, T., in press. An iterated greedy heuristic for the sequence dependent setup times flowshop with makespan and weighted tardiness objectives. European Journal of Operational Research, doi:10.1016/j.ejor.2006.07.029; Ruiz, R., Stützle, T., in press. An iterated greedy heuristic for the sequence dependent setup times flowshop with makespan and weighted tardiness objectives. European Journal of Operational Research, doi:10.1016/j.ejor.2006.07.029
[237] Ruiz, R.; Maroto, C.; Alcaraz, J., Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics, European Journal of Operational Research, 165, 34-54 (2005) · Zbl 1112.90338
[238] Ruiz, R., Sivrikaya-Serifoglu, F., Urlings, T., in press. An evolutionary approach to realistic hybrid flexible flowshop scheduling problems. Computers and Operations Research.; Ruiz, R., Sivrikaya-Serifoglu, F., Urlings, T., in press. An evolutionary approach to realistic hybrid flexible flowshop scheduling problems. Computers and Operations Research. · Zbl 1180.90135
[239] Ruiz, R., Sivrikaya-Serifoglu, F., Urlings, T., 2006. Evolutionary approach to realistic hybrid flexible flowshop scheduling problems. Technical Report. Polytechnic University of Valencia. Dept. of Applied Statistics and Operations Research, Spain.; Ruiz, R., Sivrikaya-Serifoglu, F., Urlings, T., 2006. Evolutionary approach to realistic hybrid flexible flowshop scheduling problems. Technical Report. Polytechnic University of Valencia. Dept. of Applied Statistics and Operations Research, Spain. · Zbl 1180.90135
[240] Schaller, J., in press. Scheduling on a single machine with family setups to minimize total tardiness. International Journal of Production Economic, doi:10.1016/j.ejor.2006.06.061; Schaller, J., in press. Scheduling on a single machine with family setups to minimize total tardiness. International Journal of Production Economic, doi:10.1016/j.ejor.2006.06.061 · Zbl 1137.90516
[241] Schaller, J., Gupta, J.N.D., in press. Single machine scheduling with family setups to minimize total earliness and tardiness. European Journal of Operational Research.; Schaller, J., Gupta, J.N.D., in press. Single machine scheduling with family setups to minimize total earliness and tardiness. European Journal of Operational Research. · Zbl 1137.90516
[242] Schaller, J.; Gupta, J. N.D.; Vakharia, A. J., Scheduling a flowline manufacturing cell with sequence dependent family setup times, European Journal of Operational Research, 125, 324-339 (2000) · Zbl 0965.90023
[243] Schultz, S. R.; Hodgson, T. J.; King, R. E.; Taner, M. R., Minimizing \(L_{max}\) for the single machine scheduling problem with family set-ups, International Journal of Production Research, 42, 4315-4330 (2004) · Zbl 1060.90046
[244] Schuurman, P., Woeginger, G.J., 1999. Preemptive scheduling with job-dependent setup times. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 759-767.; Schuurman, P., Woeginger, G.J., 1999. Preemptive scheduling with job-dependent setup times. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 759-767. · Zbl 1052.90562
[245] Shin, H. J.; Kim, C. O.; Kim, S. S., A tabu search algorithm for single machine scheduling with release times, due dates, and sequence-dependent set-up times, International Journal of Advanced Manufacturing Technology, 19, 859-866 (2002)
[246] Shufeng, W., Yiren, Z., 2002. Scheduling to minimize the maximum lateness with multiple product classes in batch processing. In: Proceedings of IEEE TENCON’02, pp. 1595-1598.; Shufeng, W., Yiren, Z., 2002. Scheduling to minimize the maximum lateness with multiple product classes in batch processing. In: Proceedings of IEEE TENCON’02, pp. 1595-1598.
[247] Shyu, S. J.; Lin, B. M.T.; Yin, P. Y., Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time, Computers and Industrial Engineering, 47, 181-193 (2004)
[248] Sidney, J. B.; Potss, C. N.; Sriskandarajah, C., A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups, Operations Research Letters, 26, 165-173 (2000) · Zbl 0971.90032
[249] Simons, J. V.; Russel, G. R., A case study of batching in a mass service operation, Journal of Operations Management, 20, 577-592 (2002)
[250] Sivrikaya-Serifoglu, F.; Ulusoy, G., Parallel machine scheduling with earliness and tardiness penalties, Computers and Operations Research, 26, 773-787 (1999) · Zbl 0932.90016
[251] Sonmez, A. I.; Baykasoglu, A., New dynamic programming formulation of (n×m) flowshop sequencing problems with due dates, International Journal of Production Research, 36, 2269-2283 (1998) · Zbl 0945.90560
[252] Soric, K., The CLWS heuristic for single machine scheduling problem, European Journal of Operational Research, 120, 352-358 (2000) · Zbl 0955.90034
[253] Soric, K., A cutting plane algorithm for a single machine scheduling problem, European Journal of Operational Research, 127, 383-393 (2000) · Zbl 0990.90051
[254] Sotskov, Y. N.; Tautenhahn, T.; Werner, F., On the application of insertion techniques for job shop problems with setup times, RAIRO Recherche Operationnelle, 33, 209-245 (1999) · Zbl 0960.90040
[255] Sourd, F., Earliness-tardiness scheduling with setup considerations, Computers and Operations Research, 32, 1849-1865 (2005) · Zbl 1075.90032
[256] Sourd, F., Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints, Operations Research Letters, 34, 591-598 (2006) · Zbl 1152.90468
[257] Stafford, E. F.; Tseng, F. T., Two models for a family of flowshop sequencing problems, European Journal of Operational Research, 142, 282-293 (2002) · Zbl 1082.90530
[258] Strusevich, V. A., Group technology approach to the open shop scheduling problem with batch setup times, Operations Research Letters, 26, 181-192 (2000) · Zbl 0971.90034
[259] Su, L. H.; Chou, F. D., Heuristic for scheduling in a two-machine bicriteria dynamic flowshop with setup and processing times separated, Production Planning and Control, 11, 806-819 (2000)
[260] Sun, J. U.; Hwang, H., Scheduling problem in a two-machine flow line with the N-step prior-job-dependent set-up times, International Journal of Systems Science, 32, 375-385 (2001) · Zbl 1006.90046
[261] Sun, X.; Noble, J. S., An approach to job shop scheduling with sequence-dependent setups, Journal of Manufacturing Systems, 18, 416-430 (1999)
[262] Sun, J. U.; Yee, S. R., Job shop scheduling with sequence dependent setup times to minimize makespan, International Journal of Industrial Engineering: Theory Applications and Practice, 10, 455-461 (2003)
[263] Sun, X.; Noble, J. S.; Klein, C. M., Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness, IIE Transactions, 31, 113-124 (1999)
[264] Suriyaarachchi, R. H.; Wirth, A., Earliness/tardiness scheduling with a common due date and family setups, Computers and Industrial Engineering, 47, 275-288 (2004)
[265] Tahar, D.N., Yalaoui, F., Amodeo, L., Chu, C, 2005. An ant colony system minimizing total tardiness for hybrid job shop scheduling problem with sequence dependent setup times and release dates. In: Proceedings of the International Conference on Industrial Engineering and Systems Management, Marrakech, Morocco, May 16-19, 2005, pp. 469-478.; Tahar, D.N., Yalaoui, F., Amodeo, L., Chu, C, 2005. An ant colony system minimizing total tardiness for hybrid job shop scheduling problem with sequence dependent setup times and release dates. In: Proceedings of the International Conference on Industrial Engineering and Systems Management, Marrakech, Morocco, May 16-19, 2005, pp. 469-478.
[266] Tahar, D. N.; Yalaoui, F.; Chu, C.; Amodeo, L., A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times, International Journal of Production Economics, 99, 63-73 (2006)
[267] Tamimi, S.A., Rajan, V.N., 1997. Reduction of total weighted tardiness on uniform machines with sequence dependent setups. In: Industrial Engineering Research - Conference Proceedings, pp. 181-185.; Tamimi, S.A., Rajan, V.N., 1997. Reduction of total weighted tardiness on uniform machines with sequence dependent setups. In: Industrial Engineering Research - Conference Proceedings, pp. 181-185.
[268] Tan, K. C.; Narasimhan, R., Minimizing tardiness on a single processor with sequence-dependent setup times: A simulated annealing approach, Omega, 25, 619-634 (1997)
[269] Tan, K. C.; Narasimhan, R.; Rubin, P. A.; Ragatz, G. L., A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times, Omega, 28, 313-326 (2000)
[270] Tovey, C. A., Non-approximability of precedence-constrained sequencing to minimize setups, Discrete Applied Mathematics, 134, 351-360 (2004) · Zbl 1077.68037
[271] Tseng, F. T.; Stafford, E. F., Two MILP models for the NXM SDST flowshop sequencing problem, International Journal of Production Research, 39, 1777-1809 (2001) · Zbl 1009.90042
[272] Tseng, F. T.; Gupta, J. N.D.; Stafford, E. F., A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times, Journal of the Operational Research Society, 57, 541-551 (2005) · Zbl 1113.90172
[273] Valls, V.; Perez, M. A.; Quintanilla, M. S., A tabu search approach to machine scheduling, European Journal of Operational Research, 106, 277-300 (1998) · Zbl 0991.90054
[274] Van Der Veen, J. A.A.; Woeginger, G. J.; Zhang, S., Sequencing jobs that require common resources on a single machine: A solvable case of the TSP, Mathematical Programming, Series B, 82, 235-254 (1998) · Zbl 0920.90076
[275] Van Hop, N.; Nagarur, N. N., The scheduling problem of PCBs for multiple non-identical parallel machines, European Journal of Operational Research, 158, 577-594 (2004) · Zbl 1056.90075
[276] Van Oyen, M. P.; Duenyas, I.; Tsai, C. Y., Stochastic sequencing with job families, set-up times, and due dates, International Journal of Systems Science, 30, 175-181 (1999) · Zbl 0995.90040
[277] Vieira, G. E.; Herrmann, J. W.; Lin, E., Analytical models to predict the performance of a single-machine system under periodic and event-driven rescheduling strategies, International Journal of Production Research, 38, 1899-1915 (2000) · Zbl 0944.90556
[278] Vignier, A.; Sonntag, B.; Portmann, M. C., Hybrid method for a parallel-machine scheduling problem, IEEE Symposium on Emerging Technologies and Factory Automation, ETFA, 1, 671-678 (1999)
[279] Wagelmans, A. P.M.; Gerodimos, A. E., Improved dynamic programs for some batching problems involving maximum lateness criterion, Operations Research Letters, 27, 109-118 (2000) · Zbl 0969.90049
[280] Wang, G.; Cheng, T. C.E., An approximation algorithm for parallel machine scheduling with a common server, Journal of the Operational Research Society, 52, 234-237 (2001) · Zbl 1131.90364
[281] Wang, X.; Cheng, T. C.E., Two-machine flowshop scheduling with job class setups to minimize total flowtime, Computers and Operations Research, 32, 2751-2770 (2005) · Zbl 1071.90021
[282] Wang, X.; Cheng, T. C.E., A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setups, Computers and Operations Research, 33, 1326-1344 (2006) · Zbl 1104.90024
[283] Wang, L.; Wang, M., Hybrid algorithm for earliness-tardiness scheduling problem with sequence dependent setup time, Proceedings of the IEEE Conference on Decision and Control, 2, 1219-1222 (1997)
[284] Wang, S., Zou, Y., 2002. Scheduling to minimize the maximum lateness with multiple product classes in batch processing. In: IEEE Region 10 Annual International Conference, Proceedings/TENCON 3, pp. 1595-1598.; Wang, S., Zou, Y., 2002. Scheduling to minimize the maximum lateness with multiple product classes in batch processing. In: IEEE Region 10 Annual International Conference, Proceedings/TENCON 3, pp. 1595-1598.
[285] Webster, S.; Azizoglu, M., Dynamic programming algorithms for scheduling parallel machines with family setup times, Computers and Operations Research, 28, 127-137 (2001) · Zbl 0990.90052
[286] Webster, S.; Jog, P. D.; Gupta, A., Genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date, International Journal of Production Research, 36, 2543-2551 (1998) · Zbl 0953.90527
[287] Weng, M. X.; Lu, J.; Ren, H., Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective, International Journal of Production Economics, 70, 215-226 (2001)
[288] Wilson, A. D.; King, R. E.; Hodgson, T. J., Scheduling non-similar groups on a flow line: Multiple group setups, Robotics and Computer-Integrated Manufacturing, 20, 505-515 (2004)
[289] Woeginger, G. J., A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times, Journal of Scheduling, 1, 79-87 (1998) · Zbl 0909.90184
[290] Xing, W.; Zhang, J., Parallel machine scheduling with splitting jobs, Discrete Applied Mathematics, 103, 259-269 (2000) · Zbl 0962.90020
[291] Yalaoui, F.; Chu, C., An efficient heuristic approach for parallel machine scheduling with job splitting and sequence-dependent setup times, IIE Transactions, 35, 183-190 (2003)
[292] Yang, W. H., Scheduling two-component products on parallel machines, Omega, 32, 353-359 (2004)
[293] Yang, W. H., Optimal scheduling of two-component products on a single facility, International Journal of Systems Science, 35, 49-53 (2004) · Zbl 1060.90050
[294] Yang, W.H., Chand, S., in press. Learning and forgetting effects on a group scheduling problem. European Journal of Operational Research, doi:10.1016/j.ejor.2006.03.065; Yang, W.H., Chand, S., in press. Learning and forgetting effects on a group scheduling problem. European Journal of Operational Research, doi:10.1016/j.ejor.2006.03.065 · Zbl 1137.90532
[295] Yang, D. L.; Chern, M. S., Two-machine flowshop group scheduling problem, Computers and Operations Research, 27, 975-985 (2000) · Zbl 0970.90037
[296] Yang, W. H.; Liao, C. J., Batching and sequencing of jobs with order availability at a single facility, International Journal of Systems Science, 29, 13-20 (1998)
[297] Yang, W. H.; Liao, C. J., Survey of scheduling research involving setup times, International Journal of Systems Science, 30, 143-155 (1999) · Zbl 0995.90037
[298] Yang, M. H.; Pearn, W. L.; Chung, S. H., A case study on the wafer probing scheduling problem, Production Planning and control, 13, 66-75 (2002) · Zbl 1099.90543
[299] Yang, D. L.; Kuo, W. H.; Chern, M. S., Multi-family scheduling in a two-machine reentrant flow shop with setups, European Journal of Operational Research (2006)
[300] Yi, Y.; Wang, D. W., Tabu search for scheduling grouped jobs on parallel machines, Journal of Northeastern University, 22, 188-191 (2001)
[301] Yi, Y.; Wang, D. W., Scheduling grouped jobs on parallel machines with setups, Computer Integrated Manufacturing Systems, 7, 7-11 (2001)
[302] Yi, Y.; Wang, D. W., Soft computing for scheduling with batch setup times and earliness-tardiness penalties on parallel machines, Journal of Intelligent Manufacturing, 14, 311-322 (2003)
[303] Yi, Y.; Chang, H. Y.; Wang, J.; Bai, J. C., Soft computing for parallel scheduling with setup times, Proceedings of International Conference on Machine Learning and cybernetics, 2041-2046 (2004)
[304] Yokoyama, M., in press. Flow-shop scheduling with setup and assembly operations. European Journal of Operational Research, doi:10.1016/j.ejor.2006.06.067; Yokoyama, M., in press. Flow-shop scheduling with setup and assembly operations. European Journal of Operational Research, doi:10.1016/j.ejor.2006.06.067 · Zbl 1137.90534
[305] Yuan, J. J.; Jang, A. F.; Cheng, T. C.E., A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times, European Journal of Operational Research, 158, 525-528 (2004) · Zbl 1067.90051
[306] Yuan, J.J., Liu, Z.H., Ng, C.T., Cheng, T.C.E., in press-a. Single machine batch scheduling problem with family setup times and release dates to minimize makespan. Journal of Scheduling.; Yuan, J.J., Liu, Z.H., Ng, C.T., Cheng, T.C.E., in press-a. Single machine batch scheduling problem with family setup times and release dates to minimize makespan. Journal of Scheduling. · Zbl 1154.90507
[307] Yuan, J.J., Lin, Y.X., Cheng, T.C.E., Ng, C.T., in press-b. Single machine serial-batching scheduling problem with common batch size to minimize total weighted completion time. International Journal of Production Economics.; Yuan, J.J., Lin, Y.X., Cheng, T.C.E., Ng, C.T., in press-b. Single machine serial-batching scheduling problem with common batch size to minimize total weighted completion time. International Journal of Production Economics.
[308] Zandieh, M.; Fatemi Ghomi, S. M.T.; Moattar Husseini, S. M., An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, Applied Mathematics and Computation, 180, 111-127 (2006) · Zbl 1102.90029
[309] Zhu, Z.; Heady, R. B., Minimizing the sum of earliness/tardiness in multi-machine scheduling: A mixed integer programming approach, Computers and Industrial Engineering, 38, 297-305 (2000)
[310] Zoghby, J.; Barnes, J. W.; Hasenbein, J. J., Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches, European Journal of Operational Research, 167, 336-348 (2005) · Zbl 1075.90034
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.