Minimizing completion time for a class of scheduling problems

DOI10.1016/0020-0190(84)90124-8MaRDI QIDQ794156zbMATH OpenOpenAlexFDO

Authors U. Faigle, Rainer Schrader

Publication date 1984

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(84)90124-8

zbMATH Keywords

greedy algorithmjob schedulingprecedence constraintssetup minimization problem for N-free ordered setsweighted linear scheduling problems

Mathematics Subject Classification ID

Partial orders, general (06A06) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• An algorithm for minimizing setups in precedence constrained scheduling
• scientific article; zbMATH DE number 3894817
• Algorithmic Approaches to Setup Minimization
• On the approximability of average completion time scheduling under precedence constraints.
• Rational preemptive scheduling

Cites work

• A labeling algorithm to recognize a line digraph and output its root graph
• scientific article; zbMATH DE number 3641455 (Why is no real title available?)
• Optimal Linear Extensions by Interchanging Chains

Cited in

(22)

• Jump number problem: The role of matroids
• An algorithm for minimizing setups in precedence constrained scheduling
• Interval orders without odd crowns are defect optimal
• A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
• A variant of time minimizing assignment problem
• The setup polyhedron of series-parallel posets
• A class of on-line scheduling algorithms to minimize total completion time
• A greedy algorithm for the solution of the classical NP-hard scheduling problem of minimizing the total delay
• Minimizing task completion time with the execution set method
• Quality of move-optimal schedules for minimizing total weighted completion time
• Designing PTASs for MIN-SUM scheduling problems
• A note on scheduling coupled tasks for minimum total completion time
• TSP race: minimizing completion time in time-sensitive applications
• Reducing the solution space of optimal task scheduling
• scientific article; zbMATH DE number 5723895 (Why is no real title available?)
• scientific article; zbMATH DE number 3906215 (Why is no real title available?)
• Minimizing the Range of Order Completion Times with Multiple Job Classes
• Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
• scientific article; zbMATH DE number 5059917 (Why is no real title available?)
• Algorithms for minclique scheduling problems
• An heuristic approach for solving OSSP with a objective of minimizing total completion time and resource idleness
• Minimizing setups in ordered sets of fixed width

This page was built for publication: Minimizing completion time for a class of scheduling problems

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