An efficient bicriteria algorithm for stable robotic flow shop scheduling

DOI10.1016/j.ejor.2017.01.033zbMath1403.90311OpenAlexW2582849401MaRDI QIDQ1753515

Vladimir Kats, Eugene Levner, Ada Che

Publication date: 29 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.01.033

zbMATH Keywords

schedulingstability analysiscyclic schedulingparametric critical path algorithmrobotic flow shop scheduling

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items

A dynamic scheduling approach for optimizing the material handling operations in a robotic cell, A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking, Minimizing the number of workers in a paced mixed-model assembly line, Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming

Cites Work

• Unnamed Item
• Robust optimization for the cyclic hoist scheduling problem
• Line search method for solving a non-preemptive strictly periodic scheduling problem
• Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance
• Hybrid discrete differential evolution algorithm for biobjective cyclic hoist scheduling with reentrance
• Scheduling deteriorating jobs on a single machine subject to breakdowns
• A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
• Stability of an optimal schedule
• A parametric critical path problem and an application for cyclic scheduling
• A survey of scheduling problems with no-wait in process
• Minimizing total weighted flow time under uncertainty using dominance and a stability box
• Project scheduling under uncertainty: survey and research potentials
• Measures of problem uncertainty for scheduling with interval processing times
• Flowshop scheduling problem to minimize total completion time with random and bounded processing times
• Single-machine scheduling subject to stochastic breakdowns
• Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach