Modeling and solving for bi-objective cutting parallel machine scheduling problem
- 5 April 2019
- journal article
- research article
- Published by Springer Nature in Annals of Operations Research
- Vol. 285 (1-2) , 223-245
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (51675206)
- Ministry of Industry and Information Technology of the People's Republic of China
- Hubei Key Laboratory of Hydroelectric Machinery Design & Maintenance (2017KJX10)
This publication has 42 references indexed in Scilit:
- Solution approaches for the cutting stock problem with setup costComputers & Operations Research, 2013
- A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problemsComputers & Operations Research, 2009
- On the cutting stock problem under stochastic demandAnnals of Operations Research, 2008
- Scheduling on parallel identical machines to minimize total tardinessEuropean Journal of Operational Research, 2007
- Scheduling unrelated parallel machines to minimize total weighted tardinessComputers & Operations Research, 2003
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approachIEEE Transactions on Evolutionary Computation, 1999
- Variable neighborhood searchComputers & Operations Research, 1997
- Improved heuristics for sequencing cutting patternsEuropean Journal of Operational Research, 1995
- A state-of-the-art review of parallel-machine scheduling researchEuropean Journal of Operational Research, 1990