An upper bound for the inter-exit time of two jobs in an \(m\)-machine flow shop
From MaRDI portal
Publication:6588488
DOI10.1007/S10479-024-05957-YzbMATH Open1545.90086MaRDI QIDQ6588488
Massimo Manzini, Marcello Urgo
Publication date: 15 August 2024
Published in: Annals of Operations Research (Search for Journal in Brave)
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Coordination of production and interstage batch delivery with outsourced distribution
- New hard benchmark for flowshop scheduling problems minimising makespan
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
- Permutation vs. non-permutation flow shop schedules
- Flowshop scheduling with dominant machines
- No-wait flow shop scheduling with large lot sizes
- Scheduling and lot streaming in flowshops with no-wait in process
- A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
- 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
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Flow Shop Lot Streaming
- Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
- Elimination methods in them ×n sequencing problem
- Scheduling
- 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
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)
