A fluid approach to large volume job shop scheduling
From MaRDI portal
Publication:600845
DOI10.1007/s10951-010-0174-0zbMath1201.90084OpenAlexW2127407108MaRDI QIDQ600845
Publication date: 3 November 2010
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-010-0174-0
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Optimal control of a two-server flow-shop network ⋮ An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan ⋮ Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A push-pull network with infinite supply of work
- Near optimal control of queueing networks over a finite time horizon
- Makespan minimization in open shops: A polynomial time approximation scheme
- Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
- On some geometric methods in scheduling theory: A survey
- Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
- Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
- In search of sensitivity in network optimization
- MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
- From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
- Performance evaluation and policy selection in multiclass networks
- Asymptotic optimality of maximum pressure policies in stochastic processing networks
- Restless bandits, partial conservation laws and indexability
- Sequencing and Routing in Multiclass Queueing Networks Part I: Feedback Regulation
- The Complexity of Optimal Queuing Network Control
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- Optimal and Approximately Optimal Control Policies for Queues in Heavy Traffic
- Jackson networks with unlimited supply of work
- A Fluid Heuristic for Minimizing Makespan in Job Shops
- From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
- 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 Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
- Random Yield, Rework and Scrap in a Multistage Batch Manufacturing Environment
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Cyclic Schedules for Job Shops with Identical Jobs
- Time-Sharing Service Systems. I
- Improved Approximation Algorithms for Shop Scheduling Problems
- How fair is fair queuing
- Short Shop Schedules
- Adaptive back-pressure congestion control based on local information
- Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
- Maximum Pressure Policies in Stochastic Processing Networks
- Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues
- PCB assembly scheduling for collect-and-place machines using genetic algorithms
- Control Techniques for Complex Networks
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- Numerical Methods for Stochastic Control Problems in Continuous Time
- Scheduling jobshops with some identical or similar jobs
