On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion
From MaRDI portal
Publication:744655
DOI10.1007/s10479-012-1290-3zbMath1296.90058OpenAlexW1981253957MaRDI QIDQ744655
I. D. Chernykh, D. A. Chemisova, Sergey Sevast'janov
Publication date: 26 September 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1290-3
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properties of optimal schedules in preemptive shop scheduling
- Permutation vs. non-permutation flow shop schedules
- Nonstrict vector summation in multi-operation scheduling
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- On some geometric methods in scheduling theory: A survey
- Makespan minimization in preemptive two machine job shops
- Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
- A complete 4-parametric complexity classification of short shop scheduling problems
- Better Approximation Guarantees for Job-Shop Scheduling
- A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)
- Bounding algorithm for the routing problem with arbitrary paths and alternative servers
- An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
- Computational Complexity of Discrete Optimization Problems
- Improved Approximation Algorithms for Shop Scheduling Problems
- Short Shop Schedules
- Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
- Job Shop Scheduling with Unit Processing Times
- Tight Bounds for Permutation Flow Shop Scheduling
