scientific article; zbMATH DE number 4001854

zbMATH Open0617.90047MaRDI QIDQ3754430FDOQ3754430

Author name not available (Why is that?)

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
• Note on minimizing total tardiness in a two-machine flowshop
• Minimising Maximum Lateness in a Two-Machine Flowshop
• Minimizing the number of tardy jobs in two-machine settings with common due date
• Minmax due-date assignment on a two-machine flowshop
• Two-machine flow-shop scheduling to minimize total late work: revisited
• Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine
• Minimizing The Range Of Lateness On A Single Machine Under Generalized Due Dates
• Two-machine flowshop scheduling to minimize total tardiness
• A note on minimizing maximum lateness in a two-machine no-wait flowshop

zbMATH Keywords

optimal schedulingtwo machinesoptimal due-date determination

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (2)

• Mirror image property for the optimal solutions of two single processor scheduling problems with due intervals determination
• A GENERALIZED VERSION OF ONE MACHINE MAXIMUM LATENESS PROBLEM

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