DOI QR코드

DOI QR Code

Hybrid Flow Shop with Parallel Machines at the First Stage and Dedicated Machines at the Second Stage

  • Yang, Jaehwan (College of Business Administration, University of Seoul)
  • Received : 2014.09.29
  • Accepted : 2014.12.29
  • Published : 2015.03.30

Abstract

In this paper, a two-stage hybrid flow shop problem is considered. Specifically, there exist identical parallel machines at stage 1 and two dedicated machines at stage 2, and the objective of the problem is to minimize makespan. After being processed by any machine at stage 1, a job must be processed by a specific machine at stage 2 depending on the job type, and one type of jobs can have different processing times on each machine. First, we introduce the problem and establish complexity of several variations of the problem. For some special cases, we develop optimal polynomial time solution procedures. Then, we establish some simple lower bounds for the problem. In order to solve this NP-hard problem, three heuristics based on simple rules such as the Johnson's rule and the LPT (Longest Processing Time first) rule are developed. For each of the heuristics, we provide some theoretical analysis and find some worst case bound on relative error. Finally, we empirically evaluate the heuristics.

Keywords

Two-Stage Hybrid Flow Shop;Computational Complexity;Heuristic;Worst Case Bound on Relative Error

Acknowledgement

Supported by : University of Seoul

References

  1. Brah, S. A. and Hunsucker, J. L. (1991), Branch and bound algorithm for a flowshop within multiple processors, European Journal of Operational Research, 51, 88-99. https://doi.org/10.1016/0377-2217(91)90148-O
  2. Chen, B. (1995), Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage, Journal of the Operational Research Society, 46, 23-244.
  3. Cheng, T. C. E., Kovalyov, M. Y., and Chakhlevich, K. N. (2012) Batching in a two-stage flowshop with dedicated machines in the second stage, IIE Transactions, 36, 87-93.
  4. Deal, D. E. and Hunsucker, J. L. (1991), The two-stage flowshop scheduling problem with M machines at each stage, Journal of Information and Optimization Sciences, 12, 407-417. https://doi.org/10.1080/02522667.1991.10699080
  5. Graham, R. L. (1969), Bounds on Multiprocessing Timing Anomalies, SIAM J. Appl. Math., 17, 416-429. https://doi.org/10.1137/0117039
  6. Graham, R. L., Lawler, E. L., Lenstra, J. K., and Rinnooy, Kan A. H. G. (1979), Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics, 5, 287-326. https://doi.org/10.1016/S0167-5060(08)70356-X
  7. Gupta, J. N. D. (1988), Two-stage, hybrid flowshop scheduling problem, Journal of the Operational Research Society, 39, 359-364. https://doi.org/10.1057/jors.1988.63
  8. Gupta, J. N. D., Hairi, A. M. A., and Potts, C. N. (1997), Scheduling a two-stage hybrid flow shop with parallel machines at the first stage, Annals of Operations Research, 69, 171-191. https://doi.org/10.1023/A:1018976827443
  9. Gupta, J. N. D. and Tunc, E. A. (1991), Schedules for a two-stage hybrid flowshop with parallel machines at the second stage, International Journal of Production Research, 29, 1489-1502. https://doi.org/10.1080/00207549108948025
  10. Hoogeveen, J. A., Lenstra, J. K., and Veltman, B. (1996), Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard, European Journal of Operational Research, 89, 172-175. https://doi.org/10.1016/S0377-2217(96)90070-3
  11. Hunsucker, J. L. and Shah, J. R. (1992), Performance of priority rules in a due date flowshop, OMEGA, 20, 73-89. https://doi.org/10.1016/0305-0483(92)90057-E
  12. Johnson, S. M. (1954), Optimal Two- and Three-Stage Production with Setup Times Included, Naval Research Quarterly, 61-68.
  13. Lee, C.-Y. and Variaktarakis, G. L. (1994), Minimizing makespan in hybrid flowshops, Operation Research Letters, 16, 149-159. https://doi.org/10.1016/0167-6377(94)90026-4
  14. Lin, H.-T. and Liao, C.-J. (2003), A case study in a twostage hybrid flow shop with setup time and dedicated machines, International Journal of Production Economics, 86, 133-143. https://doi.org/10.1016/S0925-5273(03)00011-2
  15. Rajendran, C. and Chaudhari, D. (1992), Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan, International Journal of Production Economics, 27, 137-143. https://doi.org/10.1016/0925-5273(92)90006-S
  16. Riane, F., Artiba, A., and Elmaghraby, S. E. (2002), Sequencing a hybrid two-stage flowshop with dedicated machines, International Journal of Production Research, 40, 4353-4380. https://doi.org/10.1080/00207540210159536
  17. Ribas, I., Leisten, R., and Framinan, J. M. (2010), Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, Computers and Operations Research, 37, 1439-1454. https://doi.org/10.1016/j.cor.2009.11.001
  18. Ruiz, R. and Vazguez-Rodriguez., J. A. (2010), The hybrid flow shop scheduling problem, European Journal of Operational Research, 205, 1-18. https://doi.org/10.1016/j.ejor.2009.09.024
  19. Wang, S. and Liu, M. (2013), A heuristic method for two-stage hybrid flow shop with dedicated machines, Computers and Operations Research, 40, 438-450. https://doi.org/10.1016/j.cor.2012.07.015
  20. Yang, J. (2010), A new complexity for the two-stage hybrid flow shop scheduling problem with dedicated machines, International Journal of Production Research, 48, 1531-1538. https://doi.org/10.1080/00207540802691374
  21. Yang, J. (2013), A two-stage hybrid flow shop with dedicated machines at the first stage, Computers and Operations Research, 40, 2836-2843. https://doi.org/10.1016/j.cor.2013.05.020
  22. Zijm, W. H. M. and Nelissen, E. H. L. B. (1990), Scheduling a flexible machining centre, Engineering Costs and Production Economics, 19, 249-258. https://doi.org/10.1016/0167-188X(90)90049-N

Cited by

  1. Schedulability Analysis for Noncyclic Operation of Time-Constrained Cluster Tools With Time Variation vol.13, pp.3, 2016, https://doi.org/10.1109/TASE.2016.2531105
  2. A Special Case of Three Machine Flow Shop Scheduling vol.15, pp.1, 2016, https://doi.org/10.7232/iems.2016.15.1.032
  3. Iterative algorithms for batching and scheduling to minimise the total job tardiness in two-stage hybrid flow shops vol.55, pp.11, 2017, https://doi.org/10.1080/00207543.2017.1304661
  4. Priority scheduling to minimize the total tardiness for remanufacturing systems with flow-shop-type reprocessing lines vol.91, pp.9-12, 2017, https://doi.org/10.1007/s00170-017-0057-z