Modeling and solution methods for hybrid flow shop scheduling problem with job rejection
Authors:
- 17 March 2021
- journal article
- research article
- Published by Springer Nature in Operational Research
- Vol. 22 (3) , 2721-2765
Abstract
No abstract availableKeywords
This publication has 78 references indexed in Scilit:
- An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problemApplied Soft Computing, 2012
- Two-machine flow-shop scheduling with rejectionComputers & Operations Research, 2012
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivalsTheoretical Computer Science, 2009
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespanTheoretical Computer Science, 2008
- An improved NEH-based heuristic for the permutation flowshop problemComputers & Operations Research, 2007
- New heuristics for m-machine no-wait flowshop to minimize total completion timeOmega, 2004
- Techniques for scheduling with rejectionJournal of Algorithms, 2003
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Two-Stage, Hybrid Flowshop Scheduling ProblemJournal of the Operational Research Society, 1988
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega, 1983