Optimal job-shop scheduling with two jobs in systems with unrestricted paths
From MaRDI portal
(Redirected from Publication:1323959)
Recommendations
Cited in
(15)- scientific article; zbMATH DE number 4010198 (Why is no real title available?)
- An efficient algorithm for the job-shop problem with two jobs
- Scheduling the General Job-Shop
- scientific article; zbMATH DE number 3941251 (Why is no real title available?)
- 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
- An existence theorem for packing problems with implications for the computation of optimal machine schedules
- scientific article; zbMATH DE number 781213 (Why is no real title available?)
- Job Shop Scheduling With Two Jobs And Nonregular Objective Functions
- scientific article; zbMATH DE number 4023001 (Why is no real title available?)
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)
