Computing lower and upper bounds for a large-scale industrial job shop scheduling problem

DOI10.1016/J.EJOR.2008.06.004zbMath1157.90412OpenAlexW2005510197MaRDI QIDQ1011298

Márton Drótos, Gábor Erdős, Tamás Kis

Publication date: 8 April 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.06.004

zbMATH Keywords

schedulingtabu searchmathematical programmingbatching

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items (2)

Solving the serial batching problem in job shop manufacturing systems ⋮ The job shop scheduling problem with convex costs

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
• Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
• New single machine and job-shop scheduling problems with availability constraints
• Minimizing total weighted tardiness in a generalized job shop
• Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
• Practical job shop scheduling
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• Tabu-search for the multi-mode job-shop problem
• Job-shop scheduling with processing alternatives.
• Minimizing the makespan for the flow shop scheduling problem with availability constraints.
• A large step random walk for minimizing total weighted tardiness in a job shop
• Decomposition methods for large job shops
• The flow shop with parallel machines: A tabu search approach
• Scheduling with batching: A review
• Scheduling with limited machine availability
• Effective neighbourhood functions for the flexible job shop problem
• A user's guide to tabu search
• Routing and scheduling in a flexible job shop by tabu search
• Applying tabu search to the job-shop scheduling problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Tabu Search—Part I
• A Fast Taboo Search Algorithm for the Job Shop Problem
• On the application of insertion techniques for job shop problems with setup times
• An overview of heuristic solution methods
• Heuristics for minimizing total weighted tardiness in complex job shops
• A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times
• Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling

This page was built for publication: Computing lower and upper bounds for a large-scale industrial job shop scheduling problem