A Permutation-Based Heuristic Method for the Blocking Job Shop Scheduling Problem
- 1 January 2019
- journal article
- Published by Elsevier BV in IFAC-PapersOnLine
- Vol. 52 (13), 1403-1408
- https://doi.org/10.1016/j.ifacol.2019.11.395
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Approaches to modeling train scheduling problems as job-shop problems with blocking constraintsJournal of Scheduling, 2017
- A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objectiveComputers & Operations Research, 2016
- An iterated greedy metaheuristic for the blocking job shop scheduling problemJournal of Heuristics, 2015
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjectiveComputers & Operations Research, 2011
- 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
- An efficient genetic algorithm for job shop scheduling with tardiness objectivesEuropean Journal of Operational Research, 2004
- Guided Local Search with Shifting Bottleneck for Job Shop SchedulingManagement Science, 1998
- Job Shop Scheduling by Simulated AnnealingOperations Research, 1992
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976