Minimizing tardy jobs in a two-stage hybrid flowshop

DOI10.1080/002075498192599zbMATH Open0945.90567OpenAlexW2120897734MaRDI QIDQ4245656FDOQ4245656

Authors: Jatinder N. D. Gupta, Enar A. Tunc 

Publication date: 9 October 2000

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/002075498192599

Recommendations

• Two-machine flowshop scheduling to minimize the number of tardy jobs
• A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage
• A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem

Mathematics Subject Classification ID

Production models (90B30)

Cited In (11)

• Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study
• Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
• Two-stage hybrid flow shop scheduling with dynamic job arrivals
• The hybrid flow shop scheduling problem
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• Modeling and optimization on operation scheduling with total tardiness objective for a storage system
• A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
• A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
• Minimizing the weighted number of tardy jobs on multiple machines: a review
• Steel-making process scheduling using Lagrangian relaxation
• A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness

This page was built for publication: Minimizing tardy jobs in a two-stage hybrid flowshop

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4245656)