Skip to Main Content

A polynomial algorithm for lot-size scheduling of two type tasks

Reference

Kovalyov, M., Pattloch, M., & Schmidt, G. (2002). A polynomial algorithm for lot-size scheduling of two type tasks. Information Processing Letters, 83(4), 229-235.

Publication Type

Article in Scientific Journal

Participating Institutions

Polynomial-time approximation schemes for two-machine open shops scheduling with nonavailability constraints

Reference

Kubzin, M., Breit, J., Schmidt, G., & Strusevich, V. (2005). Polynomial-time approximation schemes for two-machine open shops scheduling with nonavailability constraints. Naval Research Logistics.

Publication Type

Article in Scientific Journal

Participating Institutions

Ein XPS-Prototyp zur Bestimmung optimaler Aktienportfolios

Integration von Expertensystem- und konventioneller Software am Beispiel der Aktienportfolio-zusammenstellung

Ein fallbasierter Ansatz für die Fertigungsplanung und -steuerung

Lot size scheduling of two types of jobs on identical machines

Reference

Pattloch, M., & Schmidt, G. (1996). Lot size scheduling of two types of jobs on identical machines. Discrete Applied Mathematics, 65(1-3), 409-419.

Publication Type

Article in Scientific Journal

Participating Institutions

Machine aggregation heuristics in shop scheduling

Machine scheduling with availability constraints

Istanalyse: Ein Planungsmodell zur Durchführung der Systemerhebung

Scheduling on semi-identical processors

Subscribe to