Job shop scheduling with separable sequence-dependent setups

DOI10.1023/A:1018918003761MaRDI QIDQ1374429zbMATH OpenOpenAlexFDO

Authors In-Chan Choi, Osman Korkmaz

Publication date 4 December 1997

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018918003761

zbMATH Keywords

shop schedulingpolynomial time heuristicseparable sequence-dependent setups

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Sequence-dependent setup times in a two-machine job-shop with minimizing the schedule length
• Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times
• Job shop scheduling with setup times, deadlines and precedence constraints
• scientific article; zbMATH DE number 1301841
• Solving the flexible job shop scheduling problem with sequence-dependent setup times

Cited in

(18)

• A worker constrained flexible job shop scheduling problem with sequence-dependent setup times
• Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times
• scientific article; zbMATH DE number 1301841 (Why is no real title available?)
• A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
• A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times
• Sequence-dependent setup times in a two-machine job-shop with minimizing the schedule length
• scientific article; zbMATH DE number 7145128 (Why is no real title available?)
• An advanced scatter search algorithm for solving job shops with sequence dependent and non-anticipatory setups
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Optimization of setup times in the furniture industry
• Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
• A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
• A scheduling problem in a semi-open job shop -- the case of a cordset manufacturing company
• A branch and bound method for the job-shop problem with sequence-dependent setup times
• A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
• Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times
• Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
• Scheduling job shop problems with sequence-dependent setup times

This page was built for publication: Job shop scheduling with separable sequence-dependent setups

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