scientific article; zbMATH DE number 4027157

DOI10.1002/1520-6750(198802)35:1%3C35::AID-NAV3220350104%3E3.0.CO;2-3MaRDI QIDQ3768666zbMATH OpenFDO

Authors Julius Surkis, Ali Dogramaci

Publication date 1988

Full work available at URL https://doi.org/10.1002/1520-6750(198802)35:1%3C35::AID-NAV3220350104%3E3.0.CO;2-3

zbMATH Keywords

weighted shortest processing time

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Linear programming (90C05)

Recommendations

• A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems
• Minimizing the total weighted flow time in a single machine with controllable processing times
• Completion time scheduling and the WSRPT algorithm
• Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
• Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption

Cited in

(3)

• One-machine job-scheduling with non-constant capacity -- minimizing weighted completion times
• A unified view of parallel machine scheduling with interdependent processing rates
• KBSS: A knowledge-based system for scheduling in automated manufacturing

Describes a project that uses

Uses Software

• LINDO

This page was built for publication:

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