On the properties of optimal schedules in the flow shop problem with interruptions and an arbitrary regular criterion

zbMATH Open1249.90067MaRDI QIDQ3115182FDOQ3115182

Authors: D. A. Chemisova 

Publication date: 20 February 2012

Recommendations

• On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion
• Properties of optimal schedules in preemptive shop scheduling
• Some properties of optimal schedules for the Johnson problem with preemption
• Structural properties of optimal schedules with preemption
• A note on the flow-shop problem without interruptions in job processing

zbMATH Keywords

preemptionoptimal scheduleregular criteriontheory of scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (4)

• A note on the flow-shop problem without interruptions in job processing
• Properties of optimal schedules in preemptive shop scheduling
• Some properties of optimal schedules for the Johnson problem with preemption
• On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion

This page was built for publication: On the properties of optimal schedules in the flow shop problem with interruptions and an arbitrary regular criterion

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