A new continuous model for job-shop scheduling

DOI10.1080/00207728108963831zbMath0468.90033OpenAlexW2051429641MaRDI 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

simulationjob-shop schedulingoptimal control problemscontinuous problemsheuristic loading rulesinfinitely divisible jobs

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Related Items (20)

Near optimal control of queueing networks over a finite time horizon ⋮ Scheduling with divisible jobs and subcontracting option ⋮ Optimal convergence of discontinuous Galerkin methods for continuum modeling of supply chain networks ⋮ 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 ⋮ Decentralized subcontractor scheduling with divisible jobs ⋮ A robust optimization formulation for dynamic pricing of a web service with limited total shared capacity ⋮ 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 ⋮ A simplex based algorithm to solve separated continuous linear programs ⋮ Shared multi-processor scheduling ⋮ A new continuous model for multiple re-entrant manufacturing systems ⋮ A recurrence method for a special class of continuous time linear programming problems ⋮ A robust optimization approach to dynamic pricing and inventory control with no backorders ⋮ Scheduling jobshops with some identical or similar jobs ⋮ Shared processor scheduling of multiprocessor jobs ⋮ A simplex-type algorithm for continuous linear programs with constant coefficients ⋮ Continuum modeling of supply chain networks using discontinuous Galerkin methods ⋮ Shared processor scheduling ⋮ Structure of Solutions for Continuous Linear Programs with Constant Coefficients

Cites Work

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

This page was built for publication: A new continuous model for job-shop scheduling