scientific article; zbMATH DE number 894720

MaRDI QIDQ4882995zbMATH OpenFDO

Authors Heidemarie Bräsel, Martina Kleinau

Publication date 1 July 1996

zbMATH Keywords

makespanclassical shop problemstwo machine open-shop problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• On the set of solutions of the open shop problem
• The open shop scheduling problem with a given sequence of jobs on one machine
• On the hardness of the classical job shop problem
• Three-machine shop scheduling with partially ordered processing routes

Cited in

(13)

• Minimization of open orders using interval graphs
• On the set of solutions of the open shop problem
• Partially concurrent open shop scheduling with integral preemptions
• scientific article; zbMATH DE number 1910710 (Why is no real title available?)
• Amazing roles of diagonal edges on the reducibility problem of open shop sequences minimizing the makespan
• New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan
• scientific article; zbMATH DE number 1558221 (Why is no real title available?)
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• On the potentially optimal solutions of classical shop scheduling problems
• On the hardness of the classical job shop problem
• On algebraic characterizations in shop scheduling problems
• Three-machine shop scheduling with partially ordered processing routes
• The representation of partially-concurrent open shop problems

This page was built for publication:

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