IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v122y2009i2p763-773.html
   My bibliography  Save this article

Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness

Author

Listed:
  • Moslehi, G.
  • Mirzaee, M.
  • Vasei, M.
  • Modarres, M.
  • Azaron, A.

Abstract

This paper presents optimal scheduling in a two-machine flow shop, in which the objective function is to minimize the sum of maximum earliness and tardiness (n/2/P/ETmax). Since this problem tries to minimize earliness and tardiness, the results can be useful for different production systems such as just in time (JIT). This objective function has already been considered for n jobs and m machines, but the proposed algorithms are not efficient to solve large scale problems. In this paper, neighborhood conditions are developed and the dominant set for any optimal solution is determined. The branch-and-bound (B&B) method is used to solve the problem and the proper upper and lower bounds are also introduced. A number of effective lemmas are introduced to develop an algorithm which is more efficient than those already known. To show the effectiveness of the proposed algorithm, 380 problems of different sizes are randomly generated and solved. More than 82% of the problems are shown to reach optimal solutions.

Suggested Citation

  • Moslehi, G. & Mirzaee, M. & Vasei, M. & Modarres, M. & Azaron, A., 2009. "Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness," International Journal of Production Economics, Elsevier, vol. 122(2), pages 763-773, December.
    • Handle: RePEc:eee:proeco:v:122:y:2009:i:2:p:763-773
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(09)00242-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sung, C. S. & Min, J. I., 2001. "Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date," European Journal of Operational Research, Elsevier, vol. 131(1), pages 95-106, May.
    2. Nawaz, Muhammad & Enscore Jr, E Emory & Ham, Inyong, 1983. "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem," Omega, Elsevier, vol. 11(1), pages 91-95.
    3. Koulamas, Christos, 1998. "On the complexity of two-machine flowshop problems with due date related objectives," European Journal of Operational Research, Elsevier, vol. 106(1), pages 95-100, April.
    4. Peng Si Ow & Thomas E. Morton, 1989. "The Single Machine Early/Tardy Problem," Management Science, INFORMS, vol. 35(2), pages 177-191, February.
    5. Lin, Bertrand M. T., 2001. "Scheduling in the two-machine flowshop with due date constraints," International Journal of Production Economics, Elsevier, vol. 70(2), pages 117-123, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li, Shisheng & Ng, C.T. & Yuan, Jinjiang, 2011. "Group scheduling and due date assignment on a single machine," International Journal of Production Economics, Elsevier, vol. 130(2), pages 230-235, April.
    2. Mehravaran, Yasaman & Logendran, Rasaratnam, 2012. "Non-permutation flowshop scheduling in a supply chain with sequence-dependent setup times," International Journal of Production Economics, Elsevier, vol. 135(2), pages 953-963.
    3. Yenisey, Mehmet Mutlu & Yagmahan, Betul, 2014. "Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends," Omega, Elsevier, vol. 45(C), pages 119-135.
    4. Vahid Nasrollahi & Ghasem Moslehi & Mohammad Reisi-Nafchi, 2022. "Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem," Operational Research, Springer, vol. 22(2), pages 1403-1442, April.
    5. Pang, King-Wah, 2013. "A genetic algorithm based heuristic for two machine no-wait flowshop scheduling problems with class setup times that minimizes maximum lateness," International Journal of Production Economics, Elsevier, vol. 141(1), pages 127-136.
    6. Imen Hamdi & Imen Boujneh, 2022. "Particle swarm optimization based-algorithms to solve the two-machine cross-docking flow shop problem: just in time scheduling," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 947-969, September.
    7. Haimin Lu & Zhi Pei, 2024. "A distributionally robust approach for the two-machine permutation flow shop scheduling," Annals of Operations Research, Springer, vol. 338(1), pages 709-739, July.
    8. Schaller, Jeffrey & Valente, Jorge M.S., 2020. "Minimizing total earliness and tardiness in a nowait flow shop," International Journal of Production Economics, Elsevier, vol. 224(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chen, Shih-Hsin & Chen, Min-Chih, 2013. "Addressing the advantages of using ensemble probabilistic models in Estimation of Distribution Algorithms for scheduling problems," International Journal of Production Economics, Elsevier, vol. 141(1), pages 24-33.
    2. Cheng, Jinliang & Steiner, George & Stephenson, Paul, 2001. "A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times," European Journal of Operational Research, Elsevier, vol. 130(3), pages 559-575, May.
    3. Vacharapoom Benjaoran & Nashwan Dawood & Brian Hobbs, 2005. "Flowshop scheduling model for bespoke precast concrete production planning," Construction Management and Economics, Taylor & Francis Journals, vol. 23(1), pages 93-105.
    4. Andrzej Kozik, 2017. "Handling precedence constraints in scheduling problems by the sequence pair representation," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 445-472, February.
    5. Hongyu He & Yanzhi Zhao & Xiaojun Ma & Zheng-Guo Lv & Ji-Bo Wang, 2023. "Branch-and-Bound and Heuristic Algorithms for Group Scheduling with Due-Date Assignment and Resource Allocation," Mathematics, MDPI, vol. 11(23), pages 1-14, November.
    6. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    7. Solimanpur, M. & Vrat, Prem & Shankar, Ravi, 2004. "A heuristic to minimize makespan of cell scheduling problem," International Journal of Production Economics, Elsevier, vol. 88(3), pages 231-241, April.
    8. Gupta, Jatinder N.D. & Koulamas, Christos & Kyparisis, George J., 2006. "Performance guarantees for flowshop heuristics to minimize makespan," European Journal of Operational Research, Elsevier, vol. 169(3), pages 865-872, March.
    9. Yu-Jun Zheng & Yi-Chen Du & Wei-Guo Sheng & Hai-Feng Ling, 2019. "Collaborative Human–UAV Search and Rescue for Missing Tourists in Nature Reserves," Interfaces, INFORMS, vol. 49(5), pages 371-383, September.
    10. Quang Chieu Ta & Jean-Charles Billaut & Jean-Louis Bouquard, 2018. "Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 617-628, March.
    11. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    12. Ramalhinho Lourenco, Helena, 1996. "Sevast'yanov's algorithm for the flow-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 91(1), pages 176-189, May.
    13. Ghorbanzadeh, Masoumeh & Ranjbar, Mohammad, 2023. "Energy-aware production scheduling in the flow shop environment under sequence-dependent setup times, group scheduling and renewable energy constraints," European Journal of Operational Research, Elsevier, vol. 307(2), pages 519-537.
    14. B-J Joo & Y-D Kim, 2009. "A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(4), pages 572-582, April.
    15. Jean-Paul Watson & Laura Barbulescu & L. Darrell Whitley & Adele E. Howe, 2002. "Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance," INFORMS Journal on Computing, INFORMS, vol. 14(2), pages 98-123, May.
    16. Pan, Quan-Ke & Gao, Liang & Li, Xin-Yu & Gao, Kai-Zhou, 2017. "Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 89-112.
    17. Perez-Gonzalez, Paz & Framinan, Jose M., 2024. "A review and classification on distributed permutation flowshop scheduling problems," European Journal of Operational Research, Elsevier, vol. 312(1), pages 1-21.
    18. Matin, Hossein N.Z. & Salmasi, Nasser & Shahvari, Omid, 2017. "Makespan minimization in flowshop batch processing problem with different batch compositions on machines," International Journal of Production Economics, Elsevier, vol. 193(C), pages 832-844.
    19. Bharat Goyal & Sukhmandeep Kaur & Deepak Gupta, 2024. "A heuristic approach to minimizing the waiting time of jobs in two stage flow shop scheduling," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 34(1), pages 175-191.
    20. Xia, Yu & Chen, Bintong & Yue, Jinfeng, 2008. "Job sequencing and due date assignment in a single machine shop with uncertain processing times," European Journal of Operational Research, Elsevier, vol. 184(1), pages 63-75, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:proeco:v:122:y:2009:i:2:p:763-773. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.