scientific article; zbMATH DE number 553762

DOI<951::AID-NAV3220400707>3.0.CO;2-1 10.1002/1520-6750(199312)40:7<951::AID-NAV3220400707>3.0.CO;2-1zbMath0801.90060MaRDI QIDQ4287985

Awi Federgruen, Gur Mosheiov

Publication date: 19 April 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

manufacturingservicepseudo-polynomial algorithmaggregate efficiency measuresingle-machine job scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

Simultaneous minimization of total completion time and total deviation of job completion times ⋮ Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs ⋮ Single machine scheduling to minimize the number of early and tardy jobs ⋮ Hierarchical minimization of completion time variance and makespan in jobshops ⋮ Minimizing total completion time and total deviation of job completion times from a restrictive due-date ⋮ Scheduling with batch setup times and earliness-tardiness penalties ⋮ Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research ⋮ A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem

Cites Work

• Variance-Penalized Markov Decision Processes
• Global optimization