Improved algorithms for proportionate flow shop scheduling with due-window assignment
Authors:
- 22 November 2021
- journal article
- research article
- Published by Springer Nature in Annals of Operations Research
- Vol. 309 (1) , 249-258
Abstract
No abstract availableKeywords
Funding Information
- Fundamental Research Funds for the Central Universities (02060022121020)
This publication has 18 references indexed in Scilit:
- The Non-Permutation Flow-Shop scheduling problem: A literature reviewOmega, 2018
- Research on m‐machine flow shop scheduling with truncated learning effectsInternational Transactions in Operational Research, 2016
- A comprehensive review of flowshop group scheduling literatureComputers & Operations Research, 2016
- On equivalence between the proportionate flow shop and single‐machine scheduling problemsNaval Research Logistics (NRL), 2015
- Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agentsJournal of the Operational Research Society, 2014
- Minimizing makespan in three-machine flow shops with deteriorating jobsComputers & Operations Research, 2013
- Review of the ordered and proportionate flow shop scheduling researchNaval Research Logistics (NRL), 2013
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effectsAnnals of Operations Research, 2011
- Proportionate flow shop gamesJournal of Scheduling, 2008
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979