scientific article; zbMATH DE number 781213

zbMATH Open0828.90068MaRDI QIDQ4840995FDOQ4840995

Authors: Yuri N. Sotskov, N. V. Shakhlevich 

Publication date: 8 January 1996

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

Recommendations

• Scheduling two jobs with fixed and nonfixed routes
• Optimal job-shop scheduling with two jobs in systems with unrestricted paths
• scientific article; zbMATH DE number 4099022
• scientific article; zbMATH DE number 22879
• scientific article; zbMATH DE number 894722

zbMATH Keywords

preemptionsmultistage system

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (9)

• Optimal Shift Scheduling with Multiple Break Windows
• The Fixed Job Schedule Problem with Working-Time Constraints
• Optimal scheduling of slots with season segmentation
• Scheduling two jobs with fixed and nonfixed routes
• How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity of the job insertion problem in multi-stage scheduling
• Fixed-time schedules for the processing of jobs when service completions are not observable

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 Q4840995)