Scheduling of unit processing time jobs on a single machine

MaRDI QIDQ4363257zbMATH OpenFDO

Authors Suna Kondakci, Elif Emre, Murat Köksalan

Publication date 12 October 1998

zbMATH Keywords

bicriteriamaximum earlinessschedulingsingle machinetotal absolute latenesstotal earliness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Multi-objective and goal programming (90C29)

Recommendations

• Scheduling unit processing time jobs on a single machine with multiple criteria
• Single-machine scheduling of unit-time jobs with earliness and tardiness penalties
• Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
• Earliness and tardiness single machine scheduling with proportional weights
• Single-machine scheduling to minimize earliness and number of tardy jobs

Cited in

(10)

• Scheduling job classes on uniform machines
• Scheduling unit processing time jobs on a single machine with multiple criteria
• Single-machine batch scheduling with job processing time compatibility
• Scheduling unit-length jobs with machine eligibility restrictions
• scientific article; zbMATH DE number 1594558 (Why is no real title available?)
• Single-machine scheduling of unit-time jobs with earliness and tardiness penalties
• Multicriteria scheduling problems: a survey
• Job shop scheduling with unit processing times
• Counting and enumeration complexity with application to multicriteria scheduling
• A time-dependent multiple criteria single-machine scheduling problem

This page was built for publication: Scheduling of unit processing time jobs on a single machine

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