A fluid heuristic for minimizing makespan in job shops

Operations Research

Volumn 50, Issue 4, 2002, Pages 692-707

  Dai, J G ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; SCHEDULING; TIME AND MOTION STUDY;

FLUID HEURISTIC; JOB SHOPS; OPTIMAL MAKESPAN;

JOB ANALYSIS;

EID: 0036657303     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.50.4.692.2860     Document Type: Article

References (38)

1. The shifting bottleneck procedure for job-shop scheduling
2. A new continuous model for job-shop scheduling
3. Fluid models of sequencing problems in open queueing networks: An optimal control approach
4. A vector sum theorem and its application to improving flow shop guarantees
5. Asymptotically optimal algorithms for job shop scheduling and packet routing
6. Algorithms for solving job shop problems with identical and similar jobs, based on fluid approximation (Hebrew with English synopsis)
7. Scheduling jobshops with some identical or similar jobs
8. An algorithm for solving the job-shop problem
9. Parallel machine scheduling, linear programming, and parameter list scheduling heuristics
10. Dynamic scheduling of a multi class fluid network
11. Scheduling semiconductor lines using a fluid network model
12. On positive Harris recurrence of multi-class queueing networks: A unified approach via fluid limit models
13. The asymptotic optimality of the LPT rule
14. The BIGSTEP approach to flow management in stochastic processing networks
15. Probabilistic analysis and practical algorithms for the flow-shop weighted completion time problem
16. Re-entrant lines
17. Scheduling queueing networks: Stability, performance analysis and design
18. Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps
19. Sequencing and scheduling, algorithms and complexity
20. Dynamic scheduling in multiclass queueing networks: Stability under discrete-review policies
21. Discrete-review policies for scheduling stochastic networks: Trajectory tracking and fluid-scale asymptotic optimality
22. A new approach to computing optimal schedules for the job-shop scheduling problem
23. The policy improvement algorithm for Markov decision processes with general state space
24. A probabilistic analysis of 2-machine flow-shops
25. Bounding algorithm for the routing problem with arbitrary paths and alternative servers
26. On some geometric methods in scheduling theory, a survey
27. Probabilistic analysis of the minimum weighted flow-time scheduling problem
28. On the stability of multiclass queueing networks: A relaxed sufficient condition via limiting fluid processes
29. On optimal draining of fluid re-entrant lines
30. Scheduling and control of manufacturing systems - A fluid approach
31. Short shop scheduling