A new continuous model for job-shop scheduling

DOI10.1080/00207728108963831zbMath0468.90033MaRDI QIDQ3922464

Edward J. Anderson

Publication date: 1981

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207728108963831

zbMATH Keywords

simulation; job-shop scheduling; optimal control problems; continuous problems; heuristic loading rules; infinitely divisible jobs

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90B35: Deterministic scheduling theory in operations research

Related Items

Structure of Solutions for Continuous Linear Programs with Constant Coefficients, Scheduling jobshops with some identical or similar jobs, Modeling and analysis of reentrant manufacturing systems: micro- and macroperspectives, Modeling and analysis of material flows in re-entrant supply chain networks using modified partial differential equations, Near optimal control of queueing networks over a finite time horizon, Decentralized subcontractor scheduling with divisible jobs, A simplex based algorithm to solve separated continuous linear programs, A recurrence method for a special class of continuous time linear programming problems, Continuum modeling of supply chain networks using discontinuous Galerkin methods, Shared multi-processor scheduling, A new continuous model for multiple re-entrant manufacturing systems, Shared processor scheduling, Optimal convergence of discontinuous Galerkin methods for continuum modeling of supply chain networks, A robust optimization approach to dynamic pricing and inventory control with no backorders, Approximate solutions and error bounds for a class of continuous-time linear programming problems, A robust optimization model for dynamic market with uncertain production cost

Cites Work

• Unnamed Item
• A Survey of Scheduling Rules
• The Complexity of Flowshop and Jobshop Scheduling