Realistic two-stage flowshop batch scheduling problems with transportation capacity and times. (English) Zbl 1236.90049
Summary: We investigate single-batch and batch-single flow shop scheduling problem taking transportation among machines into account. Both transportation capacity and transportation times are explicitly considered. While the single processing machine processes one job at a time, the batch processing machine processes a batch of jobs simultaneously. The batch processing time is the longest processing times of jobs assigned to that batch.
MSC:
| 90B35 | Deterministic scheduling theory in operations research |
References:
| [1] | Tang, L.; Liu, P., Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration, Appl. Math. Modell., 33, 1187-1199 (2009) · Zbl 1168.90473 |
| [2] | Tang, L.; Liu, P., Flowshop scheduling problems with transportation or deterioration between the batching and single machines, Comput. Ind. Eng., 56, 1289-1295 (2009) |
| [3] | Webster, S.; Baker, K. R., Scheduling groups of jobs on a single machine, Oper. Res., 43, 692-703 (1995) · Zbl 0857.90062 |
| [4] | Potts, C. N.; Kovalyov, M. Y., Scheduling with batching: a review, Euro. J. Oper. Res., 120, 228-249 (2000) · Zbl 0953.90028 |
| [5] | Ikura, Y.; Gimple, M., Scheduling algorithms for a single batch processing machine, Oper. Res. Lett., 5, 61-65 (1986) · Zbl 0594.90045 |
| [6] | Sung, C. S.; Yoon, S. H., Minimizing maximum completion time in a two-batch-processing-machine flowshop with dynamic arrivals allowed, Eng. Optim., 28, 231-243 (1997) |
| [7] | Ahmadi, J. H.; Ahmadi, R. H.; Dasu, S.; Tang, C. S., Batching and scheduling jobs on batch and discrete processors, Oper. Res., 39, 750-763 (1992) · Zbl 0758.90042 |
| [8] | Sung, C. S.; Kim, Y. H., Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed, Comput. Oper. Res., 29, 275-294 (2002) · Zbl 0993.90051 |
| [9] | Chandru, V.; Lee, C. Y.; Uzsoy, R., Minimizing total completion time on batch processing machines, Int. J. Prod. Res., 31, 2097-2121 (1993) |
| [10] | Lee, C. Y.; Uzsoy, R.; Martin-Vega, L. A., Efficient algorithms for scheduling semiconductor burn-in operations, Oper. Res., 40, 764-775 (1992) · Zbl 0759.90046 |
| [11] | Sung, C. S.; Choung, Y. I., Minimizing makespan on a single burn-in oven in semiconductor manufacturing, Euro. J. Oper. Res., 120, 559-574 (2000) · Zbl 0971.90033 |
| [12] | Lee, C. Y.; Chen, Z. L., Machine scheduling with transportation considerations, J. Schedul., 4, 3-24 (2001) · Zbl 0979.90055 |
| [13] | Langston, M. A., Interstage transportation planning in the deterministic flow-shop environment, Oper. Res., 35, 556-564 (1987) |
| [14] | Stern, H. I.; Vitner, G., Scheduling parts in a combined production-transportation work cell, J. Oper. Res. Soc., 41, 625-632 (1990) · Zbl 0703.90047 |
| [15] | Maggu, P. L.; Das, G., On \(2^∗\) n sequencing problem with transportation times of jobs, Int. J. Pure Appl. Math. Sci., 12, 1-6 (1980) · Zbl 0441.90039 |
| [16] | Kise, H., On an automated two-machine flowshop scheduling problem with infinite buffer, J. Oper. Res. Soc. Jpn., 34, 354-361 (1991) · Zbl 0747.90048 |
| [17] | Yuan, J.; Soukhal, A.; Chen, Y.; Lu, L., A note on the complexity of flowshop scheduling with transportation constraints, Euro. J. Oper. Res., 178, 918-925 (2007) · Zbl 1163.90517 |
| [18] | Soukhal, A.; Oulamara, A.; Martineau, P., Complexity of flowshop scheduling problems with transportation constraints, Euro. J. Oper. Res., 161, 32-41 (2005) · Zbl 1065.90043 |
| [19] | Chen, Z. L.; Vairaktarakis, G. L., Integrated scheduling of production and distribution operations, Manage. Sci., 51, 614-628 (2005) · Zbl 1145.90380 |
| [20] | Chen, B.; Lee, C. Y., Logistics scheduling with batching and transportation, Euro. J. Oper. Res., 189, 871-876 (2008) · Zbl 1146.90027 |
| [21] | Tang, L.; Gong, H., A hybrid two-stage transportation and batch scheduling problem, Appl. Math. Modell., 32, 2467-2479 (2007) · Zbl 1167.90520 |
| [22] | Chang, Y. C.; Lee, C. Y., Machine scheduling with job delivery coordination, Euro. J. Oper. Res., 158, 470-487 (2004) · Zbl 1067.90041 |
| [23] | Graham, R. L.; Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H.G., Optimization and approximation in deterministic sequencing and scheduling theory: a survey, Ann. Discr. Math., 5, 287-326 (1979) · Zbl 0411.90044 |
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.
