A worker constrained flexible job shop scheduling problem with sequence-dependent setup times
From MaRDI portal
Publication:1733093
DOI10.1007/s00291-018-0537-zzbMath1411.90150OpenAlexW2901679457MaRDI QIDQ1733093
Dominik Kress, David Müller, Jenny Nossack
Publication date: 20 March 2019
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-018-0537-z
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
A survey of job shop scheduling problem: the types and models ⋮ New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot ⋮ Optimization of the integrated problem of employee timetabling and job shop scheduling ⋮ Semiconductor final-test scheduling under setup operator constraints ⋮ An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning ⋮ A novel heuristic method for the energy-efficient flexible job-shop scheduling problem with sequence-dependent set-up and transportation time ⋮ A new mathematical formulation for a potash-mine shift scheduling problem with a simultaneous assignment of machines and workers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Workforce planning incorporating skills: state of the art
- The third comprehensive survey on scheduling problems with setup times/costs
- A matheuristic approach for the two-machine total completion time flow shop problem
- Job shop scheduling with setup times, deadlines and precedence constraints
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- A tabu search algorithm for scheduling pharmaceutical packaging operations
- Scheduling subject to resource constraints: Classification and complexity
- A survey of priority rule-based scheduling
- Job-shop scheduling with multi-purpose machines
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- Logic-based Benders decomposition
- Solving the flexible job shop scheduling problem with sequence-dependent setup times
- Effective neighbourhood functions for the flexible job shop problem
- A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem
- Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times
- The significance of reducing setup times/setup costs
- A survey of scheduling problems with setup times or costs
- Computational Complexity of Discrete Optimization Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Algorithms for Solving Production-Scheduling Problems
- Handbook on Scheduling
This page was built for publication: A worker constrained flexible job shop scheduling problem with sequence-dependent setup times
