Optimal control of a two-server flow-shop network

DOI10.1007/S10951-015-0439-8zbMATH Open1328.90057OpenAlexW1059053652MaRDI QIDQ892910FDOQ892910

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

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

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)

Cites Work

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

Cited In (2)

• A search method for optimal control of a flow shop system of traditional machines
• Title not available (Why is that?)

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)