Splitting versus setup trade-offs for scheduling to minimize weighted completion time
type: Item
instance of: scholarly article
title: Splitting versus setup trade-offs for scheduling to minimize weighted completion time
zbMATH Open document ID: 1380.90111
author: José R. Correa
author: José Verschae
author: Víctor Verdugo
published in: Operations Research Letters
publication date: 2018-02-06T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6835043
zbMATH Keywords: scheduling
zbMATH Keywords: split jobs
zbMATH Keywords: weighted completion time
MaRDI profile type: Publication
Wikidata QID: Q65553893
full work available at URL: j.orl.2016.04.011
OpenAlex ID: W2371170001
cites work: A survey of scheduling problems with setup times or costs
cites work: Lot-sizing scheduling with batch setup times
cites work: Strong LP formulations for scheduling splittable jobs on unrelated machines
cites work: The power of preemption on unrelated machines and applications to scheduling orders
cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
cites work: On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost
cites work: Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
cites work: Dual Techniques for Scheduling on a Machine with Varying Speed
cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
cites work: Split scheduling with uniform setup times
cites work: Scheduling Jobs on Several Machines with the Job Splitting Property
cites work: Parallel machine scheduling with splitting jobs
DOI: 10.1016/J.ORL.2016.04.011
description: scientific article; zbMATH DE number 6835043