A robust two-machine flow-shop scheduling model with scenario-dependent processing times
Summary: In many scheduling studies, researchers consider the processing times of jobs as constant numbers. This assumption sometimes is at odds with practical manufacturing process due to several sources of uncertainties arising from real-life situations. Examples are the changing working environments, machine breakdowns, tool quality variations and unavailability, and so on. In light of the phenomenon of scenario-dependent processing times existing in many applications, this paper proposes to incorporate scenario-dependent processing times into a two-machine flow-shop environment with the objective of minimizing the total completion time. The problem under consideration is never explored. To solve it, we first derive a lower bound and two optimality properties to enhance the searching efficiency of a branch-and-bound method. Then, we propose 12 simple heuristics and their corresponding counterparts improved by a pairwise interchange method. Furthermore, we set proposed 12 simple heuristics as the 12 initial seeds to design 12 variants of a cloud theory-based simulated annealing (CSA) algorithm. Finally, we conduct simulations and report the performances of the proposed branch-and-bound method, the 12 heuristics, and the 12 variants of CSA algorithm.
- Minimizing total completion time for flowshop scheduling problem with uncertain processing times
- Minimizing total tardiness in a two-machine flowshop with uncertain and bounded processing times
- Robust scheduling on a single machine to minimize total flow time
- Flowshop scheduling problem to minimize total completion time with random and bounded processing times
- A controlable two-machine flowshop scheduling problem
- A family of inequalities valid for the robust single machine scheduling polyhedron
- A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
- A new heuristic for the n-job, M-machine flow-shop problem
- An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Dynamic facility layout problem based on open queuing network theory
- Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Flowshop sequencing with mean flowtime objective
- Heuristic algorithms for continuous flow-shop problem
- Heuristic-Programming Solution of a Flowshop-Scheduling Problem
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect
- Minimizing the number of late jobs on a single machine under due date uncertainty
- Minimizing total completion time in a two-machine flowshop: Analysis of special cases
- No-wait flowshops with bicriteria of makespan and total completion time
- Nonparametric statistical methods
- On the robust single machine scheduling problem
- Optimal two- and three-stage production schedules with set-up time included
- Optimization by simulated annealing
- Robust discrete optimization and its applications
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- The two-machine total completion time flow shop problem
- Two-machine flowshop scheduling to minimize mean flow time
This page was built for publication: A robust two-machine flow-shop scheduling model with scenario-dependent processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782088)
