Optimal control of a two-server flow-shop network

DOI10.1007/S10951-015-0439-8MaRDI QIDQ892910zbMATH OpenOpenAlexFDO

Authors Yossef Luzon, Eugene Khmelnitsky, 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) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Control/observation systems involving computers (process control, etc.) (93C83)

Recommendations

• On the structure of the optimal server control for fluid networks
• scientific article; zbMATH DE number 2156743
• Optimal control of a flexible server
• Near optimal control of queueing networks over a finite time horizon
• scientific article; zbMATH DE number 4072676

Cites work

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

Cited in

(2)

• scientific article; zbMATH DE number 2086195 (Why is no real title available?)
• A search method for optimal control of a flow shop system of traditional machines

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

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