On-line supply chain scheduling problems with preemption (Q872299): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3056948 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4223058 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Integrated Scheduling of Production and Distribution Operations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Supply Chain Scheduling: Batching and Delivery / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Machine scheduling with transportation considerations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Restarts can help in the on-line minimization of the maximum delivery time on a single machine / rank | |||
Normal rank |
Revision as of 15:37, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On-line supply chain scheduling problems with preemption |
scientific article |
Statements
On-line supply chain scheduling problems with preemption (English)
0 references
27 March 2007
0 references
scheduling
0 references
combinatorial optimization
0 references
on-line algorithm
0 references
supply chain
0 references
competitive analysis
0 references
0 references