Autor der Publikation

Single machine scheduling problem of minimising weighted sum of maximum weighted earliness and weighted number of tardy jobs.

, , und . Int. J. Manuf. Res., 16 (2): 154-186 (2021)

Bitte wählen Sie eine Person um die Publikation zuzuordnen

Um zwischen Personen mit demselben Namen zu unterscheiden, wird der akademische Grad und der Titel einer wichtigen Publikation angezeigt. Zudem lassen sich über den Button neben dem Namen einige der Person bereits zugeordnete Publikationen anzeigen.

 

Weitere Publikationen von Autoren mit dem selben Namen

Minimising the number of cancellations at the time of a severe lack of postanesthesia care unit beds or nurses., , , und . Int. J. Prod. Res., 60 (11): 3383-3396 (2022)The multiple container loading problem with loading docks., , und . Int. Trans. Oper. Res., 31 (3): 1671-1698 (Mai 2024)A note on "Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date"., und . Discret. Appl. Math., 161 (13-14): 2205-2206 (2013)Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem., , und . Oper. Res., 22 (2): 1403-1442 (2022)Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption., und . Comput. Oper. Res., (2017)Single machine scheduling problem of minimising weighted sum of maximum weighted earliness and weighted number of tardy jobs., , und . Int. J. Manuf. Res., 16 (2): 154-186 (2021)Mathematical models for preemptive shop scheduling problems., und . Comput. Oper. Res., 39 (7): 1605-1614 (2012)A Lagrangian relaxation algorithm for order acceptance and scheduling problem: a globalised robust optimisation approach., , und . Int. J. Computer Integrated Manufacturing, 29 (5): 535-560 (2016)Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time., und . JORS, 62 (7): 1403-1412 (2011)An optimal method for the preemptive job shop scheduling problem., und . Comput. Oper. Res., 40 (5): 1314-1327 (2013)