Single machine scheduling with controllable processing times to minimize total tardiness and earliness


0360-8352/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.cie.2011.08.019 ⇑ Corresponding author. Tel.: +98 111 2197584; fax E-mail addresses: (V. Kay com (I. Mahdavi), (G In most deterministic scheduling problems job processing times are considered as invariable and known in advance. Single machine… (More)
DOI: 10.1016/j.cie.2011.08.019


5 Figures and Tables