Optimal control of a two-server flow-shop network

DOI10.1007/S10951-015-0439-8zbMath1328.90057OpenAlexW1059053652MaRDI QIDQ892910

Eugene Khmelnitsky, Yossef Luzon, Yariv N. Marmor

Publication date: 12 November 2015

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-015-0439-8

zbMATH Keywords

optimal controlscheduling policyflow-shop networkfluid-based queueing disciplinetandem fluid network

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Control/observation systems involving computers (process control, etc.) (93C83) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fluid approach to large volume job shop scheduling
• Approximability of flow shop scheduling
• Optimal flow control in manufacturing systems. Production planning and scheduling. Incl. 1 disk
• From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
• Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• A survey on problems and methods in generalized assembly line balancing
• Optimal two- and three-stage production schedules with setup times included
• Planning and Scheduling in Manufacturing and Services
• Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
• A New Algorithm for State-Constrained Separated Continuous Linear Programs
• An Algorithm for a Class of Continuous Linear Programs
• Dynamic Scheduling of a Multiclass Fluid Network
• A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem
• On the Solutions of a Class of Continuous Linear Programs
• Forms of Optimal Solutions for Separated Continuous Linear Programs
• Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
• Minimum Flow Time in a Tandem Two-Server Fluid Network
• Control Techniques for Complex Networks
• Optimal Strategies for Priority Queues with Nonlinear Costs of Delay
• Stability conditions for multiclass fluid queueing networks
• Scheduling
• Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
• A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.

This page was built for publication: Optimal control of a two-server flow-shop network