Flexible open shop scheduling problem to minimize makespan
From MaRDI portal
Publication:342284
DOI10.1016/J.COR.2015.10.012zbMATH Open1349.90313OpenAlexW2189731345MaRDI QIDQ342284FDOQ342284
Authors: 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
Recommendations
- Open shop scheduling problem to minimize makespan with release dates
- Two-stage flow-open shop scheduling problem to minimize makespan
- Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- New efficient heuristics for scheduling open shops with makespan minimization
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling. Theory, algorithms, and systems.
- Scheduling open shops with parallel machines to minimize total completion time
- Bounds for Certain Multiprocessing Anomalies
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Open Shop Scheduling to Minimize Finish Time
- Two-Processor Scheduling with Start-Times and Deadlines
- Scheduling flow shops using differential evolution algorithm
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- Linear time approximation scheme for the multiprocessor open shop problem
- A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
- A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
- 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
- A genetic algorithm for the proportionate multiprocessor open shop
- 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
- A tabu search approach for proportionate multiprocessor open shop scheduling
- The logic of logistics. Theory, algorithms, and applications for logistics management
- Open shop scheduling problem to minimize makespan with release dates
- Title not available (Why is that?)
- Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
- Dense open-shop schedules with release times
Cited In (15)
- Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
- On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem
- Retracted article: Multi-objective open shop scheduling by considering human error and preventive maintenance
- Large-scale medical examination scheduling technology based on intelligent optimization
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions
- An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Open shop scheduling problem to minimize makespan with release dates
- Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan
- Two-stage flow-open shop scheduling problem to minimize makespan
- Open shop scheduling with makespan and total completion time criteria
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
- An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan
This page was built for publication: Flexible open shop scheduling problem to minimize makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342284)
