Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
From MaRDI portal
Publication:1652150
DOI10.1016/J.COR.2016.09.023zbMath1391.90279OpenAlexW2528956552MaRDI QIDQ1652150
Danial Khorasanian, Ghasem Moslehi
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.09.023
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items (2)
Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ No-wait two-stage flowshop problem with multi-task flexibility of the first machine
Cites Work
- Unnamed Item
- Optimizing blocking flow shop scheduling problem with total completion time criterion
- A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots
- A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
- Two-machine flowshop scheduling with flexible operations and controllable processing times
- Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
- Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
- Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems
- Throughput optimization in two-machine flowshops with flexible operations
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- Variable neighborhood search
- A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
- Mathematical models for preemptive shop scheduling problems
- Flow-shop scheduling with flexible processors
- Benchmarks for basic scheduling problems
- Optimal planning of part's machining on a number of machines
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- A note on scheduling alternative operations in two-machine flowshops
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Sequencing of robot activities and parts in two-machine robotic cells
- Scheduling alternative operations in two-machine flow-shops
- Lower bounding schemes for flowshops with blocking in-process
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
This page was built for publication: Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
