A linear programming-based method for job shop scheduling
From MaRDI portal
Publication:2434310
DOI10.1007/s10951-012-0270-4zbMath1280.90035OpenAlexW2085278304MaRDI QIDQ2434310
Kerem Bülbül, Philip M. Kaminsky
Publication date: 5 February 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-012-0270-4
linear programmingsensitivity analysissingle machinejob shopshifting bottleneckearliness/tardinessnon-regular objectiveintermediate inventory holding costsoptimal timing problem
Related Items (4)
Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem ⋮ Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem ⋮ A neighborhood for complex job shop scheduling problems with regular objectives ⋮ The job shop scheduling problem with convex costs
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- Preemption in single machine earliness/tardiness scheduling
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Metaheuristics for scheduling in industrial and manufacturing applications
- A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints
- A large step random walk for minimizing total weighted tardiness in a job shop
- Decomposition methods for large job shops
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- Development and analysis of cost-based dispatching rules for job shop scheduling
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem
- A computational study of shifting bottleneck procedures for shop scheduling problems
- New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- An analysis of heuristics in a dynamic job shop with weighted tardiness objectives
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
This page was built for publication: A linear programming-based method for job shop scheduling