Reducibility among single machine weighted completion time scheduling problems

DOI10.1007/BF02248586MaRDI QIDQ922287zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Scheduling of a single machine to minimize total weighted completion time subject to release dates
• Scheduling with release dates on a single machine to minimize total weighted completion time
• scientific article; zbMATH DE number 5723895
• Two scheduling problems of minimizing the maximum weighted completion time
• Complexity of a scheduling problem with controllable processing times

Cites work

• scientific article; zbMATH DE number 3708086 (Why is no real title available?)
• scientific article; zbMATH DE number 3485481 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates
• A decomposition algorithm for the single machine total tardiness problem
• A note on a scheduling problem with dual criteria
• 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
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• Minimizing Weighted Completion Times with Deadlines
• ON THE USE OF DECOMPOSITION APPROACHES IN A SINGLE MACHINE SCHDULING PROBLEM
• On n/1/?? dynamic deterministic problems
• Scheduling of a single machine to minimize total weighted completion time subject to release dates
• Scheduling to minimize the weighted sum of completion times with secondary criteria
• Scheduling with deadlines and loss functions
• Scheduling with release dates on a single machine to minimize total weighted completion time
• Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
• Single machine scheduling to minimize weighted sum of completion times with secondary criterion - A branch and bound approach
• Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines
• Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem
• The Deadline Constrained Weighted Completion Time Problem: Analysis of a Heuristic

Cited in

(4)

• 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
• Theory and methodology of time-dependent scheduling: past, present and future
• Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case

This page was built for publication: Reducibility among single machine weighted completion time scheduling problems

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