Multiple machine JIT scheduling: a tabu search approach

DOI10.1080/00207540600871228zbMath1126.90327OpenAlexW1991573703MaRDI QIDQ5428715

Mark T. Traband, Daniel A. Finke, D. J. Medeiros

Publication date: 26 November 2007

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540600871228

zbMATH Keywords

earliness-tardinesstabu searchmultiple machine scheduling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items

Simulation optimisation of pull control policies for serial manufacturing lines and assembly manufacturing systems using genetic algorithms, Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows, A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows, Control methods for dynamic time-based manufacturing under customized product lead times, The hybrid flow shop scheduling problem, Self-imposed time windows in vehicle routing problems

Cites Work

• A nonlinear mixed integer goal programming model for the two-machine closed flow shop
• Design and evaluation of tabu search algorithms for multiprocessor scheduling
• Tabu search for total tardiness minimization in flowshop scheduling problems
• Using tabu search to solve the common due date early/tardy machine scheduling problem
• The flow shop with parallel machines: A tabu search approach
• Performance enhancements to tabu search for the early/tardy scheduling problem
• Tabu search for resource-constrained scheduling
• A tabu search approach to machine scheduling
• A tabu search approach to the constraint satisfaction problem as a general problem solver
• Solving zero-one mixed integer programming problems using tabu search
• Optimization of process plans using a constraint-based tabu search approach
• Sequencing with Earliness and Tardiness Penalties: A Review
• Tabu Search—Part I
• Tabu Search—Part II
• Minimizing the sum of job earliness and tardiness in a multimachine system
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
• Improving the Efficiency of Tabu Search for Machine Sequencing Problems
• Single machine weighted earliness-tardiness penalty problem with a common due date
• New and ``stronger job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996)
• Tabu search for a class of single-machine scheduling problems
• Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates