scientific article
From MaRDI portal
Publication:3362479
zbMATH Open0763.90052MaRDI QIDQ3362479
Publication date: 1991
Title of this publication is not available (Why is that?)
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Recommendations
- Title not available (Why is that?) π π
- Minimization of the maximal lateness for a single machine π π
- Finding the minimum waiting losses in a single-server queuing system π π
- Minimization of the weighted sum of overdue customers in a single-server system π π
- Minimizing the weighted number of tardy task units π π
- Minimizing the weighted sum of squared tardiness on a single machine π π
- Minimizing the weighted number of tardy jobs on a single machine π π
- A note on the allocation of queuing facilities using a minisum criterion π π
- STACS 2004 π π
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 Q3362479)