Scheduling in a Sequence Dependent Setup Environment with Genetic Search

Abstract

Work on scheduling in the presence of squence dependent setup times has generally focused on minimizing the total setup time (or cost) or minimizing the makespan of a set of jobs. We explore the problem of sequencing to minimize the total tardiness of a set of jobs in a single-stage process where setup times are sequence dependent. In particular, we examine the efficacy of using genetic search to develop near optimal schedules in this environment.

Publication
Computers and Operations Research
Date

Citation

Rubin, Paul A. and Gary L. Ragatz (1995). “Scheduling in a Sequence Dependent Setup Environment with Genetic Search”. In: Computers and Operations Research 22.1, pp. 85-99. DOI: 10.1016/0305-0548(93)E0021-K.

BibTeX

@Article{RubinRagatz95, title = {Scheduling in a Sequence Dependent Setup Environment with Genetic Search}, author = {Paul A. Rubin and Gary L. Ragatz}, journal = {Computers and Operations Research}, year = {1995}, month = {January}, number = {1}, pages = {85–99}, volume = {22}, doi = {10.1016/0305-0548(93)E0021-K}, }