Flexible open shop scheduling problem to minimize makespan
From MaRDI portal
Publication:342284
DOI10.1016/j.cor.2015.10.012zbMath1349.90313OpenAlexW2189731345MaRDI QIDQ342284
Danyu Bai, Zhi-Hai Zhang, Qiang Zhang
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.10.012
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (5)
Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop ⋮ A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions ⋮ Large-scale medical examination scheduling technology based on intelligent optimization ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Multi-objective open shop scheduling by considering human error and preventive maintenance
Cites Work
- Unnamed Item
- Open shop scheduling problem to minimize makespan with release dates
- Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm
- Scheduling open shops with parallel machines to minimize total completion time
- Scheduling flow shops using differential evolution algorithm
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
- A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
- A differential evolution approach for the common due date early/tardy job scheduling problem
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
- Dense open-shop schedules with release times
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- A genetic algorithm for the proportionate multiprocessor open shop
- A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
- Scheduling open shops with parallel machines
- Approximation algorithms for the multiprocessor open shop scheduling problem
- Worst-case analysis of heuristics for open shops with parallel machines
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- A tabu search approach for proportionate multiprocessor open shop scheduling
- The Logic of Logistics
- Open Shop Scheduling to Minimize Finish Time
- Two-Processor Scheduling with Start-Times and Deadlines
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Bounds for Certain Multiprocessing Anomalies
- Scheduling
- Linear time approximation scheme for the multiprocessor open shop problem
This page was built for publication: Flexible open shop scheduling problem to minimize makespan
