( en | de | ru )

 

Disambiguation of "Sterna, Malgorzata"

Author of the publication

copydeleteadd this publication to your clipboard
Scheduling on parallel identical machines with late work criterion: Offline and online cases.

, , , and . J. Sched., 19 (6): 729-736 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sterna Kaufmann

Franziska Sterna

Brigitte Sterna

Malgorzata Broncel

Malgorzata Ritter

 

Other publications of authors with the same name

Mirror scheduling problems with early work and late work criteria., , , and . J. Sched., 24 (5): 483-487 (2021)Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date., , , and . KI, volume 3698 of Lecture Notes in Computer Science, page 222-234. Springer, (2005)Scheduling on parallel identical machines with late work criterion: Offline and online cases., , , and . J. Sched., 19 (6): 729-736 (2016)A note on the two machine job shop with the weighted late work criterion., , , and . J. Sched., 10 (2): 87-95 (2007)Late work minimization in a small flexible manufacturing system.. Comput. Ind. Eng., 52 (2): 210-228 (2007)Complexity of late work minimization in flow shop systems and a particle swarm optimization algorithm for learning effect., , , , and . Comput. Ind. Eng., (2017)A comparison of solution procedures for two-machine flow shop scheduling with late work criterion., , , and . Comput. Ind. Eng., 49 (4): 611-624 (2005)Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date., , , , and . Eur. J. Oper. Res., 284 (1): 67-74 (2020)Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work., and . J. Optim. Theory Appl., 174 (3): 927-944 (2017)Alternative algorithms for identical machines scheduling to maximize total early work with a common due date., , , , and . Comput. Ind. Eng., (2022)