scientific article; zbMATH DE number 3784624

zbMATH Open0497.90036MaRDI QIDQ3962767FDOQ3962767

Authors: Alexander H. G. Rinnooy Kan, Eugene L. Lawler, Jan Karel Lenstra 

Publication date: 1982

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

zbMATH Keywords

NP-hardnessminimization of maximum latenesstwo-machine open shopno preemptions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited In (3)

• On the complexity of generalized due date scheduling problems
• Minimizing the weighted number of tardy jobs on multiple machines: a review
• Scheduling shops to minimize the weighted number of late jobs

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