scientific article; zbMATH DE number 3904315

MaRDI QIDQ3682222zbMATH OpenFDO

Authors Shigeji Miyazaki, Noriyuki Nishiyama

Publication date 1984

zbMATH Keywords

heuristic algorithmtardinessbranch and bound methodearlinessone machine schedulingexact and approximate methodstotal penaltiesadjacent pairwise interchange approachjob completion

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 40475
• The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
• Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
• Multiple-machine scheduling with earliness, tardiness and completion time penalties
• A branch and bound approach for single machine scheduling with earliness and tardiness penalties

Cited in

(5)

• A branch and bound approach for single machine scheduling with earliness and tardiness penalties
• Scheduling to minimize release-time resource consumption and tardiness penalties
• Scheduling to minimize weighted earliness and tardiness about a common due-date
• Solving scheduling problems with earliness and tardiness penalties using priority rules and linear programming
• Scheduling to minimize the total compression and late costs

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 Q3682222)