Optimal job-shop scheduling with two jobs in systems with unrestricted paths

zbMATH Open0799.90067MaRDI QIDQ1323959FDOQ1323959

Authors: V. A. Strusevich, N. V. Shakhlevich 

Publication date: 6 July 1994

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Recommendations

• An efficient algorithm for the job-shop problem with two jobs
• scientific article; zbMATH DE number 4023001
• Scheduling the General Job-Shop
• scientific article; zbMATH DE number 894722
• On the complexity of two machine job-shop scheduling with regular objective functions

zbMATH Keywords

optimal job-shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (15)

• Title not available (Why is that?)
• An efficient algorithm for the job-shop problem with two jobs
• Scheduling the General Job-Shop
• Title not available (Why is that?)
• Job-shop with two jobs and irregular criteria
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Subset-restricted interchange for dynamic min-max scheduling problems
• AN OPTIMAL SEQUENCENING PROBLEM FOR A TWO-STAGE FLOW SHOP WITH ALTERNATIVE JOB ASSIGNMENTS
• AN O(n^2 log^2 n) ALGORITHM FOR INPUT-OR-OUTPUT TEST IN DISJUNCTIVE SCHEDULING
• Optimal selection and scheduling of jobs with uncertain durations for two employees
• Solving job shop problems in the context of hypergraphs
• Job Shop Scheduling With Two Jobs And Nonregular Objective Functions
• An existence theorem for packing problems with implications for the computation of optimal machine schedules
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Optimal job-shop scheduling with two jobs in systems with unrestricted paths

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