Scheduling job shop problems with sequence-dependent setup times
From MaRDI portal
Publication:3055268
DOI10.1080/00207540802165817zbMath1198.90198MaRDI QIDQ3055268
Bahman Naderi, Seyyed Mohammad Taghi Fatemi Ghomi, Mostafa Zandieh
Publication date: 7 November 2010
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540802165817
90B35: Deterministic scheduling theory in operations research
Related Items
Multi-stage stochastic mean-semivariance-CVaR portfolio optimization under transaction costs, The third comprehensive survey on scheduling problems with setup times/costs, A contribution and new heuristics for open shop scheduling, Solving the serial batching problem in job shop manufacturing systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Local search genetic algorithms for the job shop scheduling problem
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
- Scheduling of FMSs with information delays: a simulation study
- Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem
- Improved immune algorithm for global numerical optimization and job-shop scheduling problems
- Practical job shop scheduling
- Job shop scheduling with separable sequence-dependent setups
- Job shop scheduling with group-dependent setups, finite buffers, and long time horizon
- Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- Scheduling flexible flow lines with sequence-dependent setup times
- Benchmarks for basic scheduling problems
- A survey of scheduling problems with setup times or costs
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- A hybrid genetic algorithm for the job shop scheduling problem
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- On the Complexity of Scheduling with Batch Setup Times
