Scheduling unit processing time jobs on an m-machine flow-shop
From MaRDI portal
Publication:4678245
DOI10.1057/palgrave.jors.2601512zbMath1088.90028OpenAlexW1981829973MaRDI QIDQ4678245
Publication date: 23 May 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601512
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (4)
A survey on offline scheduling with rejection ⋮ Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system ⋮ The just-in-time scheduling problem in a flow-shop scheduling system ⋮ Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem
This page was built for publication: Scheduling unit processing time jobs on an m-machine flow-shop