A fluid approach to large volume job shop scheduling

DOI10.1007/S10951-010-0174-0zbMATH Open1201.90084OpenAlexW2127407108MaRDI QIDQ600845FDOQ600845

Authors: Yoni Nazarathy, Gideon Weiss 

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

Recommendations

• Scheduling jobshops with some identical or similar jobs
• A Fluid Heuristic for Minimizing Makespan in Job Shops
• scientific article; zbMATH DE number 2156743
• Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
• From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective

zbMATH Keywords

fluid approximationmakespanstochastic schedulingjob shopsfluid tracking policy

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Restless bandits, partial conservation laws and indexability
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• PCB assembly scheduling for collect-and-place machines using genetic algorithms
• Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
• Numerical Methods for Stochastic Control Problems in Continuous Time
• MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
• Title not available (Why is that?)
• Short Shop Schedules
• An Algorithm for Solving the Job-Shop Problem
• Adaptive back-pressure congestion control based on local information
• Title not available (Why is that?)
• Control Techniques for Complex Networks
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• Makespan minimization in open shops: A polynomial time approximation scheme
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
• Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
• The complexity of optimal queuing network control
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• Time-Sharing Service Systems. I
• Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues
• Improved Approximation Algorithms for Shop Scheduling Problems
• Sequencing and routing in multiclass queueing networks. I: Feedback regulation
• Random Yield, Rework and Scrap in a Multistage Batch Manufacturing Environment
• Title not available (Why is that?)
• Asymptotic optimality of maximum pressure policies in stochastic processing networks
• Maximum Pressure Policies in Stochastic Processing Networks
• Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
• Jackson networks with unlimited supply of work
• A push-pull network with infinite supply of work
• Near optimal control of queueing networks over a finite time horizon
• Cyclic Schedules for Job Shops with Identical Jobs
• Performance evaluation and policy selection in multiclass networks
• On some geometric methods in scheduling theory: A survey
• From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
• 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
• Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
• Scheduling jobshops with some identical or similar jobs
• In search of sensitivity in network optimization
• Optimal and Approximately Optimal Control Policies for Queues in Heavy Traffic
• Title not available (Why is that?)
• Bounding algorithm for the routing problem with arbitrary paths and alternative servers
• A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees
• How fair is fair queuing

Cited In (10)

• Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan
• 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
• Optimal control of a two-server flow-shop network
• Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
• A hybrid fluid master–apprentice evolutionary algorithm for large-scale multiplicity flexible job-shop scheduling with sequence-dependent set-up time
• Scheduling jobshops with some identical or similar jobs
• An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan
• From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
• An algorithm for the maximum revenue jobshop problem

Uses Software

• Job Shop Simulation

This page was built for publication: A fluid approach to large volume job shop scheduling

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