A study on open shop scheduling to minimise total tardiness
DOI10.1080/00207543.2010.497174zbMATH Open1356.90059OpenAlexW2028651280MaRDI QIDQ2967576FDOQ2967576
S. M. T. Fatemi Ghomi, Mostafa Zandieh, Majid Aminnayeri, Bahman Naderi
Publication date: 1 March 2017
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207543.2010.497174
Recommendations
- A mixed integer linear formulation for the open shop earliness-tardiness scheduling problem
- Scheduling preemptive open shops to minimize total tardiness
- Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
- Tabu search for total tardiness minimization in flowshop scheduling problems
genetic algorithmmathematical modelschedulingtotal tardinessmixed integer linear programmingTaguchi methodopen shopvariable neighbourhood serach
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Algorithms for Solving Production-Scheduling Problems
- Benchmarks for basic scheduling problems
- A genetic algorithm for flexible job shop scheduling with fuzzy processing time
- A study of integer programming formulations for scheduling problems
- New MILP models for the permutation flowshop problem
- Comparative evaluation of MILP flowshop models
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
- A contribution and new heuristics for open shop scheduling
- Scheduling flexible flow lines with sequence-dependent setup times
- A new particle swarm optimization for the open shop scheduling problem
- A branch \(\&\) bound algorithm for the open-shop problem
- An improved genetic algorithm for the flowshop scheduling problem
- Scheduling preemptive open shops to minimize total tardiness
- A new lower bound for the open-shop problem
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
Cited In (5)
- A tabu search approach for proportionate multiprocessor open shop scheduling
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions
- Optimization for cooperative task planning of heterogeneous multi-robot systems in an order picking warehouse
- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization
- New efficient heuristics for scheduling open shops with makespan minimization
This page was built for publication: A study on open shop scheduling to minimise total tardiness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2967576)
