Author of the publication

Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.

, and . Oper. Res. Lett., 31 (2): 142-148 (2003)

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.

 

Other publications of authors with the same name

Approximating the Incremental Knapsack Problem., , and . CoRR, (2018)New exact approaches and approximation results for the Penalized Knapsack Problem., , and . Discrete Applied Mathematics, (2019)On approximating the Incremental Knapsack Problem., , and . Discrete Applied Mathematics, (2019)A greedy-based neighborhood search approach to a nurse rostering problem., , , and . European Journal of Operational Research, 153 (1): 28-40 (2004)An improved branch-and-bound algorithm for the two machine total completion time flow shop problem., , and . European Journal of Operational Research, 139 (2): 293-301 (2002)Minimizing tardy jobs in a flowshop with common due date., , and . European Journal of Operational Research, 120 (2): 375-381 (2000)Heuristic approaches for a domestic energy management system., , , , , and . Computers & Industrial Engineering, (2017)Exact Algorithms for Dominating Clique Problems., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 4-13. Springer, (2009)A tight linear time $$1312$$ -approximation algorithm for the $$P2 || C_$$ problem., , and . J. Comb. Optim., 38 (2): 608-617 (2019)A note on "Two-machine flow-shop scheduling with rejection" and its link with flow-shop scheduling and common due date assignment., and . Computers & OR, 39 (12): 3244-3246 (2012)