Zobrazeno 1 - 10
of 101 558
pro vyhledávání: '"Single machine"'
Autor:
Gradwohl, Matthew, Sewa, Guidio, Oghojafor, Oke Blessing, Wilouwou, Richard, Adamu, Muminu, Thron, Christopher
Flowshop problems play a prominent role in operations research, and have considerable practical significance. The single-machine flowshop problem is of particular theoretical interest. Until now the problem of minimizing late jobs or job tardiness ca
Externí odkaz:
http://arxiv.org/abs/2409.03778
Autor:
Balzereit, Kaja, Grüttemeier, Niels, Morawietz, Nils, Reinhardt, Dennis, Windmann, Stefan, Wolf, Petra
In this work, we study the task of scheduling jobs on a single machine with sequence dependent family setup times under the goal of minimizing the makespan, that is, the completion time of the last job in the schedule. This notoriously NP-hard proble
Externí odkaz:
http://arxiv.org/abs/2409.00771
We study the fundamental scheduling problem $1\mid r_j\mid\sum w_j U_j$: schedule a set of $n$ jobs with weights, processing times, release dates, and due dates on a single machine, such that each job starts after its release date and we maximize the
Externí odkaz:
http://arxiv.org/abs/2408.12967
Since the publication of the first scheduling paper in 1954, a huge number of works dealing with different types of single machine problems appeared. They addressed many heuristics and enumerative procedures, complexity results or structural properti
Externí odkaz:
http://arxiv.org/abs/2405.18789
Autor:
Bai, Bing1 (AUTHOR) baibing@stu.sau.edu.cn, Wei, Cai-Min2 (AUTHOR) cmwei@stu.edu.cn, He, Hong-Yu3 (AUTHOR) cmwei@stu.edu.cn, Wang, Ji-Bo1 (AUTHOR) cmwei@stu.edu.cn
Publikováno v:
Mathematics (2227-7390). Sep2024, Vol. 12 Issue 18, p2883. 19p.
This paper resolves a long-standing open question in bicriteria scheduling regarding the complexity of a single machine scheduling problem which combines the number of tardy jobs and the maximal tardiness criteria. We use the lexicographic approach w
Externí odkaz:
http://arxiv.org/abs/2404.02784
Publikováno v:
International Journal of Science and Research (IJSR), ISSN: 2319-7064, Volume 13 Issue 28, November 2023
The study explores the optimization of evolutionary solver parameters for minimizing total tardiness in single machine scheduling, an NP-hard problem with zero ready times included. It investigates various parameter combinations, including population
Externí odkaz:
http://arxiv.org/abs/2403.19109
Publikováno v:
European Journal of Operational Research, Volume 308, Issue 3, 1 August 2023, Pages 990-1006
In this paper, we investigate the use of the deep learning method for solving a well-known NP-hard single machine scheduling problem with the objective of minimizing the total tardiness. We propose a deep neural network that acts as a polynomial-time
Externí odkaz:
http://arxiv.org/abs/2402.14847
Autor:
Liu, Zheng1 (AUTHOR) liuzheng1@stu.sau.edu.cn, Wang, Ji-Bo1 (AUTHOR) wangjibo@sau.edu.cn
Publikováno v:
Mathematics (2227-7390). Aug2024, Vol. 12 Issue 16, p2522. 20p.
Autor:
Fischer, Nick, Wennmann, Leo
In this work we revisit the elementary scheduling problem $1||\sum p_j U_j$. The goal is to select, among $n$ jobs with processing times and due dates, a subset of jobs with maximum total processing time that can be scheduled in sequence without viol
Externí odkaz:
http://arxiv.org/abs/2402.13357