A robust two-machine flow-shop scheduling model with scenario-dependent processing times

DOI10.1155/2020/3530701zbMath1459.90095OpenAlexW3034714867MaRDI QIDQ782088

Lini Duan, Chin-Chia Wu, Juin-Han Chen, Chia-Lun Hsu, Win-Chin Lin, Jan-Ray Liao

Publication date: 22 July 2020

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/3530701

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A state-of-the-art survey on multi-scenario scheduling

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Single machine scheduling problems with uncertain parameters and the OWA criterion
• A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
• Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop
• Minimizing the number of late jobs on a single machine under due date uncertainty
• On the robust single machine scheduling problem
• Complexity of single machine scheduling problems under scenario-based uncertainty
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
• Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
• Flowshop sequencing with mean flowtime objective
• The two-machine total completion time flow shop problem
• Robust discrete optimization and its applications
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
• Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect
• Dynamic facility layout problem based on open queuing network theory
• A family of inequalities valid for the robust single machine scheduling polyhedron
• A new heuristic for the n-job, M-machine flow-shop problem
• Two-machine flowshop scheduling to minimize mean flow time
• Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
• Optimal two- and three-stage production schedules with setup times included
• Heuristic algorithms for continuous flow-shop problem
• Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯
• Flowshop and Jobshop Schedules: Complexity and Approximation
• No-wait flowshops with bicriteria of makespan and total completion time
• An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
• Heuristic-Programming Solution of a Flowshop-Scheduling Problem
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production

This page was built for publication: A robust two-machine flow-shop scheduling model with scenario-dependent processing times