Two-machine flow shop scheduling problems with minimal and maximal delays

DOI10.1007/S10288-005-0069-7MaRDI QIDQ862809zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Flow shopbranch-and-bound procedureMax-Plus algebra

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

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

Cited in

(29)

• Lower bounds for the two-machine flow shop problem with time delays
• Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing
• Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
• 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 TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
• Exact method for the two-machine flow-shop problem with time delays
• Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
• Two-machine interval shop scheduling with time lags
• Three-machine flow shop scheduling with overlapping waiting time constraints
• A note on minimizing maximum lateness in a two-machine no-wait flowshop
• Minmax due-date assignment on a two-machine flowshop
• An algebraic expression of the number partitioning problem
• Two-machine flowshop scheduling with job class setups to minimize total flowtime
• Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
• An algorithm with bounds for the proportional case of a two-machine problem in flow-shop scheduling theory with minimum delays
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• scientific article; zbMATH DE number 3908146 (Why is no real title available?)
• Model approximation for batch flow shop scheduling with fixed batch sizes
• Analysis of heuristics for the UET two-machine flow shop problem with time delays
• Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations
• A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays
• Maximizing total early work in a distributed two‐machine flow‐shop
• Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines
• Minimizing total completion time in two-machine flow shops with exact delays
• A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
• Applications of max-plus algebra to flow shop scheduling problems
• Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic

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)