A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking

DOI10.3934/jimo.2018040zbMath1415.90045OpenAlexW2802307620WikidataQ129711209 ScholiaQ129711209MaRDI QIDQ2423281

Cheng-Hu Yang, Mahmoud Masoud, Pengyu Yan, Shi Qiang Liu

Publication date: 21 June 2019

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2018040

zbMATH Keywords

blockingconstructive algorithmalternative graphmulti-stage scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Two-agent scheduling in a flowshop
• A hybrid evolutionary algorithm to solve the job shop scheduling problem
• Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance
• Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements
• A new constraint programming approach for optimising a coal rail system
• Algorithms for bicriteria minimization in the permutation flow shop scheduling problem
• Optimising a coal rail network under capacity constraints
• A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem
• A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
• Cyclic job shop scheduling problems with blocking
• A new neighborhood and tabu search for the blocking job shop
• Scheduling trains as a blocking parallel-machine job shop scheduling problem
• Permutation vs. non-permutation flow shop schedules
• A hybrid metaheuristic algorithm to optimise a real-world robotic cell
• An integrated approach for scheduling health care activities in a hospital
• Approaches to modeling train scheduling problems as job-shop problems with blocking constraints
• An efficient bicriteria algorithm for stable robotic flow shop scheduling
• Job-shop scheduling with blocking and no-wait constraints
• Stochastic scheduling on parallel machines to minimize discounted holding costs
• A priority-based genetic algorithm for a flexible job shop scheduling problem
• A branch and bound algorithm for scheduling trains in a railway network
• Optimal stochastic scheduling
• Surgical case scheduling as a generalized job shop scheduling problem
• Throughput of flow lines with unreliable parallel-machine workstations and blocking
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows
• Principles of Sequencing and Scheduling
• Minimizing Cycle Time in a Blocking Flowshop
• METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM
• Planning and Scheduling in Manufacturing and Services
• Cyclic job scheduling in paced assembly lines with cross-trained workers

This page was built for publication: A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking