Job shop scheduling with setup times, deadlines and precedence constraints
From MaRDI portal
Publication:835609
DOI10.1007/S10951-008-0067-7zbMATH Open1168.90419OpenAlexW2086998347MaRDI QIDQ835609FDOQ835609
Authors: E. Balas, Neil Simonetti, Alkis Vazacopoulos 
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-008-0067-7
Recommendations
dynamic programmingsequence-dependent setup timestraveling salesman problem with time windows shifting bottleneck
Cites Work
- A Dynamic Programming Approach to Sequencing Problems
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- The one-machine sequencing problem
- Guided local search with shifting bottleneck for job shop scheduling
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
- A branch and bound method for the job-shop problem with sequence-dependent setup times
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
- New classes of efficiently solvable generalized traveling salesman problems
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
- Job shop scheduling with deadlines
Cited In (28)
- A scatter search approach to sequence-dependent setup times job shop scheduling
- Sequencing and scheduling for filling lines in dairy production
- Semiconductor final-test scheduling under setup operator constraints
- A worker constrained flexible job shop scheduling problem with sequence-dependent setup times
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
- A neighborhood for complex job shop scheduling problems with regular objectives
- Job shop scheduling with deadlines
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- The third comprehensive survey on scheduling problems with setup times/costs
- Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
- Optimization of setup times in the furniture industry
- A multi-criteria approach for scheduling semiconductor wafer fabrication facilities
- A column generation-based heuristic for a rehabilitation patient scheduling and routing problem
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
- Scatter search with path relinking for the job shop with time lags and setup times
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
- Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis
- Mathematical model applied to single-track line scheduling problem in Brazilian railways
- A survey of scheduling problems with setup times or costs
- History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence
- Scheduling for multi-robot routing with blocking and enabling constraints
- Scheduling job shops with delays
- A branch and bound method for the job-shop problem with sequence-dependent setup times
- Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach
- A competent memetic algorithm for complex scheduling
- Depth-first heuristic search for the job shop scheduling problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- A practical use of Jackson's preemptive schedule for solving the job shop problem
This page was built for publication: Job shop scheduling with setup times, deadlines and precedence constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835609)
