Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach
From MaRDI portal
Publication:3569929
Recommendations
- Job shop scheduling with setup times, deadlines and precedence constraints
- Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis
- Scheduling job shop problems with sequence-dependent setup times
- Scheduling job shop problems with operators with respect to the maximum lateness
- Constraint Propagation Based Scheduling of Job Shops
- Lagrangian bounds for just-in-time job-shop scheduling
- scientific article; zbMATH DE number 558544
- scientific article; zbMATH DE number 1418275
- Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
- On the application of insertion techniques for job shop problems with setup times
Cited in
(9)- An efficient filtering algorithm for the unary resource constraint with transition times and optional activities
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
- Temporal constraint satisfaction techniques in job shop scheduling problem solving
- Large-scale periodic scheduling in time-sensitive networks
- Scatter search with path relinking for the job shop with time lags and setup times
- Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis
- Optimization of the integrated problem of employee timetabling and job shop scheduling
- Underground mine scheduling of mobile machines using constraint programming and large neighborhood search
- Lagrangian bounds for just-in-time job-shop scheduling
This page was built for publication: Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569929)