Flexible open shop scheduling problem to minimize makespan

DOI10.1016/J.COR.2015.10.012MaRDI QIDQ342284zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

asymptotic analysisschedulingmakespandifferential evolution algorithmflexible open shop

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3799380 (Why is no real title available?)
• A differential evolution approach for the common due date early/tardy job scheduling problem
• 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 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 novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
• A tabu search approach for proportionate multiprocessor open shop scheduling
• An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
• Approximation algorithms for the multiprocessor open shop scheduling problem
• Bounds for Certain Multiprocessing Anomalies
• Dense open-shop schedules with release times
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Linear time approximation scheme for the multiprocessor open shop problem
• Open Shop Scheduling to Minimize Finish Time
• Open shop scheduling problem to minimize makespan with release dates
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm
• Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
• Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• Scheduling flow shops using differential evolution algorithm
• Scheduling open shops with parallel machines
• Scheduling open shops with parallel machines to minimize total completion time
• Scheduling. Theory, algorithms, and systems.
• The logic of logistics. Theory, algorithms, and applications for logistics management
• Two-Processor Scheduling with Start-Times and Deadlines
• Worst-case analysis of heuristics for open shops with parallel machines

Cited in

(15)

• Open shop scheduling problem to minimize makespan with release dates
• Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
• On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem
• Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan
• Retracted article: Multi-objective open shop scheduling by considering human error and preventive maintenance
• Open shop scheduling with makespan and total completion time criteria
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
• Two-stage flow-open shop scheduling problem to minimize makespan
• Large-scale medical examination scheduling technology based on intelligent optimization
• An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times
• Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
• A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions

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)