Three-machine flow shop scheduling with overlapping waiting time constraints

DOI10.1016/j.cor.2018.06.009zbMath1458.90311OpenAlexW2809430302WikidataQ129626301 ScholiaQ129626301MaRDI QIDQ1628045

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

zbMATH Keywords

schedulingbranch and boundthree-machine flow shopwaiting time constraint

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling ⋮ Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing ⋮ A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times

Cites Work

• 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
• A matheuristic approach for the two-machine total completion time flow shop problem
• Two-machine flow shop scheduling problems with minimal and maximal delays
• A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints
• Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs
• Flowshop scheduling research after five decades
• Permutation flowshop scheduling problems with maximal and minimal time lags
• Transient Analysis of Serial Production Lines With Perishable Products: Bernoulli Reliability Model
• Principles of Sequencing and Scheduling
• A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints
• The Three-Machine No-Wait Flow Shop is NP-Complete
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Minimizing makespan on a two-machine re-entrant flowshop
• Flowshop-scheduling problems with makespan criterion: a review
• Scheduling

This page was built for publication: Three-machine flow shop scheduling with overlapping waiting time constraints