Multiple machine JIT scheduling: a tabu search approach

DOI10.1080/00207540600871228MaRDI QIDQ5428715zbMATH OpenOpenAlexFDO

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

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-tardinessmultiple machine schedulingtabu search

Mathematics Subject Classification ID

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

Recommendations

• Tabu search for the job-shop scheduling problem with multi-purpose machines
• A tabu search approach to machine scheduling
• A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times
• Tabu search for a class of single-machine scheduling problems
• Tabu-search for the multi-mode job-shop problem
• Applying tabu search to the job-shop scheduling problem
• Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• A Tabu search-based approach for scheduling job-shop type flexible manufacturing systems
• Solving a job-shop scheduling problem based on a tabu search algorithm

Cites work

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

Cited in

(7)

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

This page was built for publication: Multiple machine JIT scheduling: a tabu search approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428715)