A branch‐and‐bound algorithm for the three‐machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime
Authors:
- 5 May 2004
- journal article
- Published by Wiley in International Transactions in Operational Research
- Vol. 11 (3) , 323-339
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtimeEuropean Journal of Operational Research, 2003
- No-wait flowshops with bicriteria of makespan and total completion timeJournal of the Operational Research Society, 2002
- A review of scheduling research involving setup considerationsOmega, 1999
- A bicriteria two-machine permutation flowshop problemEuropean Journal of Operational Research, 1998
- The two-machine total completion time flow shop problemEuropean Journal of Operational Research, 1996
- A Branch-and-Bound Approach for a Two-Machine Flowshop Scheduling ProblemJournal of the Operational Research Society, 1995
- Heuristics for scheduling in flowshop with multiple objectivesEuropean Journal of Operational Research, 1995
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteriaInternational Journal of Production Research, 1994
- Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯Journal of the ACM, 1975
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954