Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function

DOI10.1016/0377-2217(93)90250-QzbMath0804.90076OpenAlexW2039473228MaRDI QIDQ1310024

Natalia V. Shakhlevich, Vitaly A. Strusevich

Publication date: 20 December 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90250-q

zbMATH Keywords

linear-time algorithmmachine usage penalty functiontwo machine open shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A PTAS for non-resumable open shop scheduling with an availability constraint, NP-hardness of shop-scheduling problems with three jobs, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, The Open Shop Scheduling Problem, Complexity of mixed shop scheduling problems: A survey, Complexity of shop-scheduling problems with fixed number of jobs: a survey, Four decades of research on the open-shop scheduling problem to minimize the makespan, The two-machine open shop problem: To fit or not to fit, that is the question, Scheduling two jobs with fixed and nonfixed routes

Cites Work

• An efficient algorithm for the job-shop problem with two jobs
• The complexity of shop-scheduling problems with two or three jobs
• Solution of the Akers-Friedman Scheduling Problem
• Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Approximation scheduling algorithms: a survey
• A Geometric Model and a Graphical Algorithm for a Sequencing Problem
• A Non-Numerical Approach to Production Scheduling Problems