Scheduling two jobs with fixed and nonfixed routes

DOI10.1007/BF02243393zbMath0808.90084OpenAlexW198859738MaRDI QIDQ1316587

Yuri N. Sotskov, Natalia V. Shakhlevich

Publication date: 15 March 1995

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02243393

zbMATH Keywords

NP-hard problemfixed number of jobsmakespan and mean flow time minimizationnonhomogeneous shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job ⋮ The three-machine proportionate open shop and mixed shop minimum makespan problems ⋮ Complexity of mixed shop scheduling problems: A survey ⋮ Complexity of shop-scheduling problems with fixed number of jobs: a survey ⋮ Approximation algorithms for the three-machine proportionate mixed shop scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The mixed shop scheduling problem
• An efficient algorithm for the job-shop problem with two jobs
• The complexity of shop-scheduling problems with two or three jobs
• Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
• Two-stage queueing systems with resource constraints and without prescribed flow paths
• Solution of the Akers-Friedman Scheduling Problem
• Two-Machine Super-Shop Scheduling Problem
• Open Shop Scheduling to Minimize Finish Time
• A Geometric Model and a Graphical Algorithm for a Sequencing Problem

This page was built for publication: Scheduling two jobs with fixed and nonfixed routes