A Fluid Heuristic for Minimizing Makespan in Job Shops

DOI10.1287/OPRE.50.4.692.2860MaRDI QIDQ3635130zbMATH OpenOpenAlexFDO

Authors J. G. Dai, Gideon Weiss

Publication date 3 July 2009

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/f484d26049a5484532ef87964045bb0a448d5193

Mathematics Subject Classification ID

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

Recommendations

• Scheduling jobshops with some identical or similar jobs
• A fluid approach to large volume job shop scheduling
• From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
• A Probabilistic Analysis of Two-Machine Flowshops
• Heuristics for short route job shop scheduling problems

Cited in

(17)

• From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
• A push-pull queueing system
• Large deviation asymptotics and control variates for simulating large functions
• A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation
• Makespan minimization in job shops: a polynomial time approximation scheme
• MINIMIZING MAKESPAN IN A MULTICLASS FLUID NETWORK WITH PARAMETER UNCERTAINTY
• A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
• Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem
• Dynamic server assignment in multiclass queues with shifts, with applications to nurse staffing in emergency departments
• An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan
• Scheduling jobshops with some identical or similar jobs
• A fluid approach to large volume job shop scheduling
• Applications of fluid models in service operations management
• A hybrid fluid master–apprentice evolutionary algorithm for large-scale multiplicity flexible job-shop scheduling with sequence-dependent set-up time
• Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan
• An algorithm for the maximum revenue jobshop problem
• A differential game formulation of a controlled network

This page was built for publication: A Fluid Heuristic for Minimizing Makespan in Job Shops

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