Flowshop sequencing problem with ordered processing time matrices: A general case
From MaRDI portal
Publication:4103316
DOI10.1002/nav.3800230310zbMath0336.90026OpenAlexW2133842767MaRDI QIDQ4103316
Milton L. Smith, R. Dudek, Shrikant S. Panwalkar
Publication date: 1976
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800230310
Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25)
Related Items (15)
The two-machine no-wait general and proportionate open shop makespan problem ⋮ The proportionate two-machine no-wait job shop scheduling problem ⋮ Minimizing maximum completion time in a proportionate flow shop with one machine of different speed ⋮ OUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMES ⋮ \(V\)- and \(\Lambda\)-shaped properties for optimal single machine schedules for a class of non-separable penalty functions ⋮ Minimizing makespan in an ordered flow shop with machine-dependent processing times ⋮ Two-machine flow shop scheduling problem with an outsourcing option ⋮ A note on makespan minimization in proportionate flow shops ⋮ Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ Flow shops with machine maintenance: ordered and proportionate cases ⋮ Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates ⋮ The three-machine proportionate flow shop problem with unequal machine speeds ⋮ The evolution of schematic representations of flow shop scheduling problems ⋮ Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines ⋮ Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
Cites Work
This page was built for publication: Flowshop sequencing problem with ordered processing time matrices: A general case
