×

Using genetic algorithms for the coordinated scheduling problem of a batching machine and two-stage transportation. (English) Zbl 1217.90037

Summary: This paper considers a coordinated scheduling problem. For the first-stage transportation there is a crane available to transport the product from the warehouse to a batching machine. For the second-stage transportation there is a vehicle available to deliver the completed jobs from the machine shop floor to the customer. The coordinated scheduling problem of production and transportation deals with sequencing the transportation of the jobs and combining them into batches to be processed. The problem of minimizing the sum of the makespan and the total setup cost was proven by Tang and Gong to be strongly NP-hard. This paper proposes two genetic algorithm (GA) approaches for this scheduling problem, with different result representations. The experimental results demonstrate that a regular GA and a modified GA (MGA) can find near-optimal solutions within an acceptable amount of computational time. Among the two proposed metaheuristic approaches, the MGA is superior to the GA both in terms of computing time and the quality of the solution.

MSC:

90B06 Transportation, logistics and supply chain management
90B35 Deterministic scheduling theory in operations research
90C59 Approximation methods and heuristics in mathematical programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Tang, L.; Gong, H., A hybrid two-stage transportation and batch scheduling problem, Applied Mathematical Modelling, 32, 2467-2479 (2008) · Zbl 1167.90520
[2] Pundoor, G.; Chen, Z.-L., Scheduling a production-distribution system to optimize the tradeoff between delivery tardiness and total distribution cost, Naval Research Logistics, 52, 571-589 (2005) · Zbl 1122.90358
[3] Lee, C.-Y.; Chen, Z.-L., Machine scheduling with transportation considerations, Journal of Scheduling, 4, 3-24 (2001) · Zbl 0979.90055
[4] Chang, Y.-C.; Lee, C.-Y., Machine scheduling with job delivery coordination, European Journal of Operational Research, 158, 470-487 (2004) · Zbl 1067.90041
[5] Zhong, W.; Dósa, G.; Tan, Z., On the machine scheduling problem with job delivery coordination, European Journal of Operational Research, 182, 1057-1072 (2007) · Zbl 1121.90068
[6] Chen, Z.-L.; Vairaktarakis, G. L., Integrated scheduling of production and distribution operations, Management Science, 51, 4, 614-628 (2005) · Zbl 1145.90380
[7] Soukhal, A.; Oulamara, A.; Martineau, P., Complexity of flow shop scheduling problems with transportation constraints, European Journal of Operational Research, 161, 1, 32-41 (2005) · Zbl 1065.90043
[8] Wang, G.; Cheng, T. C.E., Parallel machine scheduling with batch delivery costs, International Journal of Production Economics, 68, 177-183 (2000)
[9] Ji, M.; He, Y.; Cheng, T. C.E., Batch delivery scheduling with batch delivery cost on a single machine, European Journal of Operational Research, 176, 745-755 (2007) · Zbl 1125.90018
[10] Chen, B.; Lee, C.-Y., Logistics scheduling with batching and transportation, European Journal of Operational Research, 189, 871-876 (2008) · Zbl 1146.90027
[11] Tang, L.; Liu, P., Two-machine flowshop scheduling problems involving a batch machine with transportation or deterioration consideration, Applied Mathematical Modeling, 33, 1187-1199 (2009) · Zbl 1168.90473
[12] Li, C.-L.; Ou, J. W., Machine scheduling with pickup and delivery, Naval Research Logistics, 52, 1-14 (2005)
[13] Qu, P.; Mason, S. J., Metaheuristic scheduling of 300-mm lots containing multiple orders, IEEE Transactions on Semiconductor Manufacturing, 18, 4, 633-643 (2005)
[14] Holland, J., Adaptation in Natural and Artificial Systems (1975), The University of Michigan Press: The University of Michigan Press MI
[15] Hejazi, S. R.; Saghafian, S., Flowshop-scheduling problems with makespan criterion: a review, International Journal of Production Research, 43, 14, 2895-2929 (2005) · Zbl 1068.90059
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.