Two-machine flow shop scheduling problems with minimal and maximal delays
From MaRDI portal
Publication:862809
DOI10.1007/S10288-005-0069-7zbMATH Open1125.90350OpenAlexW2081841173MaRDI QIDQ862809FDOQ862809
Authors: Jean-Louis Bouquard, Ch. Lenté 
Publication date: 24 January 2007
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-005-0069-7
Recommendations
- Lower bounds for the two-machine flow shop problem with time delays
- An algorithm with bounds for the proportional case of a two-machine problem in flow-shop scheduling theory with minimum delays
- A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays
- Exact method for the two-machine flow-shop problem with time delays
- Minimising Maximum Lateness in a Two-Machine Flowshop
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cited In (29)
- Analysis of heuristics for the UET two-machine flow shop problem with time delays
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
- A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
- Exact method for the two-machine flow-shop problem with time delays
- SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
- Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing
- Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations
- Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
- Minmax due-date assignment on a two-machine flowshop
- Three-machine flow shop scheduling with overlapping waiting time constraints
- Lower bounds for the two-machine flow shop problem with time delays
- A note on minimizing maximum lateness in a two-machine no-wait flowshop
- Maximizing total early work in a distributed two‐machine flow‐shop
- Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
- A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays
- Two-machine interval shop scheduling with time lags
- Two-machine flowshop scheduling with job class setups to minimize total flowtime
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
- Model approximation for batch flow shop scheduling with fixed batch sizes
- Applications of max-plus algebra to flow shop scheduling problems
- Title not available (Why is that?)
- Minimizing total completion time in two-machine flow shops with exact delays
- ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
- Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
- An algorithm with bounds for the proportional case of a two-machine problem in flow-shop scheduling theory with minimum delays
- Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines
- Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
- An algebraic expression of the number partitioning problem
This page was built for publication: Two-machine flow shop scheduling problems with minimal and maximal delays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862809)
