2019
DOI: 10.3390/a13010009
|View full text |Cite
|
Sign up to set email alerts
|

Special Issue on Exact and Heuristic Scheduling Algorithms

Abstract: This special issue of Algorithms is a follow-up issue of an earlier one, entitled ‘Algorithms for Scheduling Problems’. In particular, the new issue is devoted to the development of exact and heuristic scheduling algorithms. Submissions were welcome both for traditional scheduling problems as well as for new practical applications. In the Call for Papers, we mentioned topics such as single-criterion and multi-criteria scheduling problems with additional constraints including setup times (costs), precedence con… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 9 publications
(9 citation statements)
references
References 10 publications
0
5
0
Order By: Relevance
“…Scheduling theory is a widely discussed research topic in operations research and industrial engineering [5][6][7][20][21][22]. However, since HTS is a relatively new technology, its scheduling problems have not yet been extensively studied.…”
Section: Related Work: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Scheduling theory is a widely discussed research topic in operations research and industrial engineering [5][6][7][20][21][22]. However, since HTS is a relatively new technology, its scheduling problems have not yet been extensively studied.…”
Section: Related Work: Literature Reviewmentioning
confidence: 99%
“…The goal is to find a cyclic schedule of robot moves that minimizes cycle time, i.e., maximizes cell productivity. From the point of view of scheduling theory, the scheduling problem under consideration is a cyclic single-robot, multiple-machine flowshop scheduling problem with blocking and re-entry [5][6][7]]. An HTS system with an optimal schedule can minimize the overall screening time, maximizing the throughput and hence reducing associated costs and enabling diagnosis of diseases and rapid discovery of new drugs [8][9][10].…”
Section: Introductionmentioning
confidence: 99%
“…We react to the appearance of jobs by looking for the best assignment in that specific moment, which is measured by its contribution to the total setup time and the cost of the operations. Therefore, we consider the whole problem closer to a scheduling one [8][9][10], where breakdowns (or more generally, incidents) are jobs, and the cars/trucks sent by the company to fix them or tow the vehicle to a garage are machines. Each of the steps that compose this scheduling involve an allocation of a resource to an incident.…”
Section: Related Literaturementioning
confidence: 99%
“…As the BEP estimation by practical approach is cumbersome, time-consuming, and may not be feasible, the study was extended to develop the methodology and techniques to estimate the BEP based on theoretical means. To identify suitable heuristic techniques, a literature survey was made [5,6] on various heuristic techniques and the forward approach technique was found to be the most suitable to reach the goal in steps [7].…”
Section: Introductionmentioning
confidence: 99%