The open shop scheduling problem with a given sequence of jobs on one machine

DOI10.1002/(SICI)1520-6750(199810)45:7%3C705::AID-NAV4%3E3.0.CO;2-FMaRDI QIDQ4248937zbMATH OpenOpenAlexFDO

Authors

Publication date 10 June 1999

Full work available at URL https://doi.org/10.1002/(sici)1520-6750(199810)45:7%3C705::aid-nav4%3E3.0.co;2-f

zbMATH Keywords

complexityapproximationopen shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• The total completion time open shop scheduling problem with a given sequence of jobs on one machine
• An open shop scheduling problem with a non-bottleneck machine
• Nonpreemptive open shop with restricted processing times
• Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops

Cited in

(20)

• Relocation scheduling subject to fixed processing sequences
• Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type
• A note: maximizing the weighted number of just-in-time jobs for a given job sequence
• Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines
• Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
• Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
• Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
• The total completion time open shop scheduling problem with a given sequence of jobs on one machine
• scientific article; zbMATH DE number 4131935 (Why is no real title available?)
• Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
• Vyacheslav Tanaev: contributions to scheduling and related areas
• A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence
• Scheduling with centralized and decentralized batching policies in concurrent open shops
• On the open-shop problem with preemption and minimizing the average completion time
• Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Single-machine scheduling with supporting tasks
• An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity

This page was built for publication: The open shop scheduling problem with a given sequence of jobs on one machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4248937)