On-line supply chain scheduling problems with preemption
type: Item
instance of: scholarly article
title: On-line supply chain scheduling problems with preemption
zbMATH Open document ID: 1121.90051
author: Zhihui Xue
author: Igor Averbakh
published in: European Journal of Operational Research
publication date: 2007-03-27T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5137746
zbMATH Keywords: scheduling
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: on-line algorithm
zbMATH Keywords: supply chain
zbMATH Keywords: competitive analysis
MaRDI profile type: Publication
full work available at URL: j.ejor.2006.06.004
OpenAlex ID: W2050028837
cites work: Q3056948
cites work: Q4223058
cites work: Integrated Scheduling of Production and Distribution Operations
cites work: Supply Chain Scheduling: Batching and Delivery
cites work: A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
cites work: Machine scheduling with transportation considerations
cites work: Restarts can help in the on-line minimization of the maximum delivery time on a single machine
DOI: 10.1016/J.EJOR.2006.06.004
description: scientific article; zbMATH DE number 5137746