An upper bound for the inter-exit time of two jobs in an m-machine flow shop

DOI10.1007/S10479-024-05957-YMaRDI QIDQ6588488zbMATH OpenFDO

Authors Marcello Urgo, Massimo Manzini

Publication date 15 August 2024

Published in Annals of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10479-024-05957-Y

zbMATH Keywords

flow shopinter-exit timescheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Batching and scheduling in a multi-machine flow shop
• Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
• Permutation vs. non-permutation flow shop schedules
• Permutation schedules for a two-machine flow shop with storage
• On Minimizing the Expected Makespan and Flow Time in Stochastic Flow Shops with Blocking

Cites work

• A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
• Coordination of production and interstage batch delivery with outsourced distribution
• Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
• Elimination methods in them ×n sequencing problem
• Flow Shop Lot Streaming
• Flowshop scheduling with dominant machines
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• Integrated Production and Outbound Distribution Scheduling: Review and Extensions
• Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
• New hard benchmark for flowshop scheduling problems minimising makespan
• No-wait flow shop scheduling with large lot sizes
• On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time
• Optimal two- and three-stage production schedules with set-up time included
• Permutation vs. non-permutation flow shop schedules
• Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions
• Scheduling
• Scheduling and lot streaming in flowshops with no-wait in process
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times

This page was built for publication: An upper bound for the inter-exit time of two jobs in an \(m\)-machine flow shop

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6588488)