Scheduling jobshops with some identical or similar jobs
From MaRDI portal
Publication:5946718
DOI10.1002/jos.72zbMath0979.90052OpenAlexW2054382234MaRDI QIDQ5946718
Gideon Weiss, Michal Penn, Tami Boudoukh
Publication date: 10 February 2002
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jos.72
Related Items (8)
A fluid approach to large volume job shop scheduling ⋮ Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints ⋮ Construction of cyclic schedules in presence of parallel machines ⋮ Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem ⋮ An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan ⋮ An algorithm for the maximum revenue jobshop problem ⋮ Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan ⋮ A push-pull queueing system
Cites Work
- Unnamed Item
- Unnamed Item
- Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
- On some geometric methods in scheduling theory: A survey
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- A Fluid Heuristic for Minimizing Makespan in Job Shops
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Bounding algorithm for the routing problem with arbitrary paths and alternative servers
- An Algorithm for Solving the Job-Shop Problem
- A new continuous model for job-shop scheduling
- A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
- Cyclic Schedules for Job Shops with Identical Jobs
- Short Shop Schedules
- Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
This page was built for publication: Scheduling jobshops with some identical or similar jobs
