Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times

DOI10.1007/978-1-4614-8588-9_2zbMATH Open1344.90020OpenAlexW1596128MaRDI QIDQ2820105FDOQ2820105

Boris Goldengorin, Mikhail Batsyn, Pavel Sukhov, Panos M. Pardalos

Publication date: 13 September 2016

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-8588-9_2

zbMATH Keywords

assignment problemlower boundsingle machine schedulingupper boundrelease datesequal processing timesweighted completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling
• Scheduling jobs with equal processing times and time windows on identical parallel machines
• Scheduling equal-length jobs on identical parallel machines
• A 1. 47-approximation for a preemptive single-machine scheduling problem
• A classification of static scheduling problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Single parameter analysis of power of preemption on two and three uniform machines
• Modeling single machine preemptive scheduling problems for computational efficiency
• An exact algorithm for the preemptive single machine scheduling of equal-length jobs
• Title not available (Why is that?)

This page was built for publication: Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times

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