scientific article
From MaRDI portal
Publication:4016820
zbMath0764.90043MaRDI QIDQ4016820
No author found.
Publication date: 16 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (9)
Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Branch less, cut more and minimize the number of late equal-length jobs on identical machines ⋮ Is a unit-job shop not easier than identical parallel machines? ⋮ Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity ⋮ A note on the maximum number of on-time jobs on parallel identical machines. ⋮ Preemptive scheduling of equal-length jobs to maximize weighted throughput. ⋮ The bottleneck transportation problem with auxiliary resources ⋮ A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem ⋮ Minimizing the number of late jobs on unrelated machines
This page was built for publication:
