A Permutation-Based Neighborhood for the Blocking Job-Shop Problem with Total Tardiness Minimization
- 26 May 2018
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Operations Research Proceedings
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A neighborhood for complex job shop scheduling problems with regular objectivesJournal of Scheduling, 2017
- Approaches to modeling train scheduling problems as job-shop problems with blocking constraintsJournal of Scheduling, 2017
- Scheduling trains as a blocking parallel-machine job shop scheduling problemComputers & Operations Research, 2009
- A new neighborhood and tabu search for the Blocking Job ShopDiscrete Applied Mathematics, 2009
- A branch and bound algorithm for scheduling trains in a railway networkEuropean Journal of Operational Research, 2007
- Job-shop scheduling with blocking and no-wait constraintsEuropean Journal of Operational Research, 2002