Flowshop Sequencing Problem with Ordered Processing Time Matrices
From MaRDI portal
Publication:4058808
DOI10.1287/mnsc.21.5.544zbMath0302.90025OpenAlexW1989809236MaRDI QIDQ4058808
R. Dudek, Milton L. Smith, Shrikant S. Panwalkar
Publication date: 1975
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.21.5.544
Related Items (33)
Two-machine ordered flowshop scheduling under random breakdowns ⋮ Flowshop scheduling with dominant machines ⋮ Minimizing maximum completion time in a proportionate flow shop with one machine of different speed ⋮ Single-machine and two-machine flowshop scheduling with general learning functions ⋮ Asymptotic optimality of statistical multiplexing in pipelined processing ⋮ OUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMES ⋮ An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines ⋮ Minimizing makespan in an ordered flow shop with machine-dependent processing times ⋮ Proportionate Flow Shop Scheduling with Rejection ⋮ Two-machine flow shop scheduling problem with an outsourcing option ⋮ A note on makespan minimization in proportionate flow shops ⋮ Minimizing tardy jobs in a flowshop with common due date ⋮ Non-permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ Flowshop sequencing problem with ordered processing time matrices: A general case ⋮ Online scheduling of ordered flow shops ⋮ A note on the proportionate flow shop with a bottleneck machine ⋮ Flow-shops with a dominant machine ⋮ Analysis of flow shop scheduling anomalies ⋮ Incomplete information and multiple machine queueing problems ⋮ Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ Flow shops with machine maintenance: ordered and proportionate cases ⋮ Flow shops with reentry: reversibility properties and makespan optimal schedules ⋮ 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 ⋮ Reduction of job-shop problems to flow-shop problems with precedence constraints ⋮ Proportionate flow shop: New complexity results and models with due date assignment ⋮ An Ordered Flow Shop with Two Agents ⋮ Optimal streaming of a single job in a two-stage flow shop ⋮ Lot streaming in open shops ⋮ Production scheduling with applications in the printing industry
This page was built for publication: Flowshop Sequencing Problem with Ordered Processing Time Matrices