@inbook{dafbd90c9f7f415e8eb8d5e1496fb52c,
title = "A problem-independent search heuristic for single machine scheduling with release dates and deadlines",
abstract = "This paper presents a new search heuristic F that determines the feasibility of scheduling a set of jobs on a single machine where each job is characterized by its release date, processing time, and deadline. F alternates between (i) a construction phase that builds a partial feasible solution by assigning positions to on-time jobs and (ii) a backtracking phase that removes on-time jobs that are causing the tardiness of the current job. F chooses jobs according to a new dynamic priority rule. It stops when it successfully schedules all jobs or when it reaches a threshold runtime. F is unique in two ways. It does not guide its search via a problem-dependent heuristic. In addition, its parameters are problem-independent; thus, require no tuning. Experimental results provide computational evidence that F is superior to existing heuristics such as NEH and Profile Fitting.",
keywords = "Deadlines, Position manipulation, Release dates, Scheduling, Search heuristic",
author = "Yacine Laalaoui and Rym M'Hallah",
note = "Publisher Copyright: {\textcopyright} 2022 IEEE.; 2022 IEEE Symposium Series on Computational Intelligence, SSCI 2022 ; Conference date: 04-12-2022 Through 07-12-2022",
year = "2022",
doi = "10.1109/SSCI51031.2022.10022172",
language = "English",
series = "Proceedings of the 2022 IEEE Symposium Series on Computational Intelligence, SSCI 2022",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "782--789",
editor = "Hisao Ishibuchi and Chee-Keong Kwoh and Ah-Hwee Tan and Dipti Srinivasan and Chunyan Miao and Anupam Trivedi and Keeley Crockett",
booktitle = "Proceedings of the 2022 IEEE Symposium Series on Computational Intelligence, SSCI 2022",
address = "United States",
}