Three-machine flow shop scheduling with overlapping waiting time constraints
DOI10.1016/J.COR.2018.06.009zbMATH Open1458.90311OpenAlexW2809430302WikidataQ129626301 ScholiaQ129626301MaRDI QIDQ1628045FDOQ1628045
Authors: Y. Aharonov 
Publication date: 3 December 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.06.009
Recommendations
- Solving constrained flow-shop scheduling problems with three machines
- scientific article
- The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times
- Three-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times
- Optimal scheduling of the 3-machine assembly-type flow shop
- A New Heuristic for Three-Machine Flow Shop Scheduling
- TWO-AND THREE-MACHINE FLOW-SHOP MAKESPAN SCHEDULING PROBLEMS WITH ADDITIONAL TIMES SEPARATED FROM PROCESSING TIMES
- Three-machine shop scheduling with partially ordered processing routes
- A worst-case analysis of the three-machine flow shop scheduling
- A new three-machine shop scheduling: complexity and approximation algorithm
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling. Theory, algorithms, and systems.
- A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints
- Flowshop scheduling research after five decades
- Permutation flowshop scheduling problems with maximal and minimal time lags
- Principles of Sequencing and Scheduling
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Flowshop-scheduling problems with makespan criterion: a review
- A matheuristic approach for the two-machine total completion time flow shop problem
- A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints
- Two-machine flow shop scheduling problems with minimal and maximal delays
- Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
- Minimizing makespan on a two-machine re-entrant flowshop
- Minimizing makespan in three-machine flow shops with deteriorating jobs
- Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
- The Three-Machine No-Wait Flow Shop is NP-Complete
- Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs
- Transient Analysis of Serial Production Lines With Perishable Products: Bernoulli Reliability Model
Cited In (7)
- A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
- Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing
- Title not available (Why is that?)
- TWO-AND THREE-MACHINE FLOW-SHOP MAKESPAN SCHEDULING PROBLEMS WITH ADDITIONAL TIMES SEPARATED FROM PROCESSING TIMES
- Optimal scheduling of the 3-machine assembly-type flow shop
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
- Model formulations for the machine scheduling problem with limited waiting time constraints
This page was built for publication: Three-machine flow shop scheduling with overlapping waiting time constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1628045)
