The open shop scheduling problem with a given sequence of jobs on one machine
From MaRDI portal
Publication:4248937
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6750(199810)45:7<705::AID-NAV4>3.0.CO;2-F" /><705::AID-NAV4>3.0.CO;2-F 10.1002/(SICI)1520-6750(199810)45:7<705::AID-NAV4>3.0.CO;2-FzbMath0936.90029OpenAlexW2072542613MaRDI QIDQ4248937
No author found.
Publication date: 10 June 1999
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199810)45:7<705::aid-nav4>3.0.co;2-f
Related Items (14)
Relocation scheduling subject to fixed processing sequences ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines ⋮ Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence ⋮ A note: maximizing the weighted number of just-in-time jobs for a given job sequence ⋮ Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type ⋮ Vyacheslav Tanaev: contributions to scheduling and related areas ⋮ Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence ⋮ Scheduling with centralized and decentralized batching policies in concurrent open shops ⋮ Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Single-machine scheduling with supporting tasks ⋮ Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times ⋮ The total completion time open shop scheduling problem with a given sequence of jobs on one machine
This page was built for publication: The open shop scheduling problem with a given sequence of jobs on one machine
