A Fluid Heuristic for Minimizing Makespan in Job Shops

Authors:
J. G. Dai;Gideon Weiss
Affiliations:
-;-
Venue:
Operations Research
Year:
2002

Citing 0
Cited 9

Continuous-Review Tracking Policies for Dynamic Control of Stochastic Networks

Queueing Systems: Theory and Applications
Approximately optimal control of fluid networks

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions

Mathematics of Operations Research
Multiproduct Systems with Both Setup Times and Costs: Fluid Bounds and Schedules

Operations Research
Optimal distributed real-time scheduling of flexible manufacturing networks modeled as hybrid dynamical systems

Robotics and Computer-Integrated Manufacturing
Minimizing makespan in a multiclass fluid network with parameter uncertainty

Probability in the Engineering and Informational Sciences
A differential game formulation of a controlled network

Queueing Systems: Theory and Applications
A fluid approach to large volume job shop scheduling

Journal of Scheduling
A push-pull queueing system

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a simple online heuristic for scheduling job shops. We assume there is a fixed set of routes for the jobs, and many jobs, sayN, on each route. The heuristic uses safety stocks and keeps the bottleneck machine busy at almost all times, while the other machines are paced by the bottleneck machine. We perform a probabilistic analysis of the heuristic, under some assumptions on the distributions of the processingtimes. We show that our heuristic produces makespan, which exceeds the optimal makespan by no more thanclog N with a probability that exceeds 1-1/ N for allN = 1, wherec is some constant independent ofN.