scientific article; zbMATH DE number 894720

zbMATH Open0848.90068MaRDI QIDQ4882995FDOQ4882995

Martina Kleinau, Heidemarie Bräsel

Publication date: 1 July 1996

Title of this publication is not available (Why is that?)

zbMATH Keywords

makespanclassical shop problemstwo machine open-shop problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (9)

• On the set of solutions of the open shop problem
• Title not available (Why is that?)
• Partially concurrent open shop scheduling with integral preemptions
• New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Title not available (Why is that?)
• On the hardness of the classical job shop problem
• Three-machine shop scheduling with partially ordered processing routes
• The representation of partially-concurrent open shop problems

   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 👍 👎

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)