Reducibility among single machine weighted completion time scheduling problems

DOI10.1007/BF02248586zbMath0709.90065OpenAlexW1983340643MaRDI QIDQ922287

Marc E. Posner

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02248586

zbMATH Keywords

release datedeadlinecontinuous machine processingsum of weighted completion time problems

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling jobs on a single machine to maximize the total revenue of jobs ⋮ Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one ⋮ Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• Single machine scheduling to minimize weighted sum of completion times with secondary criterion - A branch and bound approach
• An algorithm for single machine sequencing with deadlines to minimize total weighted completion time
• An algorithm for single machine sequencing with release dates to minimize total weighted completion time
• Scheduling with release dates on a single machine to minimize total weighted completion time
• A decomposition algorithm for the single machine total tardiness problem
• Scheduling with Deadlines and Loss Functions
• Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines
• Scheduling of a single machine to minimize total weighted completion time subject to release dates
• Minimizing Weighted Completion Times with Deadlines
• The Deadline Constrained Weighted Completion Time Problem: Analysis of a Heuristic
• Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
• ON THE USE OF DECOMPOSITION APPROACHES IN A SINGLE MACHINE SCHDULING PROBLEM
• A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates
• On n/1/?? dynamic deterministic problems
• A note on a scheduling problem with dual criteria
• Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem
• Scheduling to minimize the weighted sum of completion times with secondary criteria