Portal de Periódicos da CAPES

Scheduling tasks with sequence-dependent processing times

1988; Wiley; Volume: 35; Issue: 2 Linguagem: Inglês

10.1002/1520-6750(198804)35

1520-6750

Lucio Bianco, Salvatore Ricciardelli, Giovanni Rinaldi, Antonio Sassano,

Advanced Manufacturing and Logistics Optimization

Naval Research Logistics (NRL)Volume 35, Issue 2 p. 177-184 Article Scheduling tasks with sequence-dependent processing times Lucio Bianco, Lucio Bianco Istituto di Analisi dei Sistemi ed Informatica del C.N.R., Viale Manzoni 30, 00185 RomaSearch for more papers by this authorSalvatore Ricciardelli, Salvatore Ricciardelli Istituto di Analisi dei Sistemi ed Informatica del C.N.R., Viale Manzoni 30, 00185 RomaSearch for more papers by this authorGiovanni Rinaldi, Giovanni Rinaldi Istituto di Analisi dei Sistemi ed Informatica del C.N.R., Viale Manzoni 30, 00185 RomaSearch for more papers by this authorAntonio Sassano, Antonio Sassano Istituto di Analisi dei Sistemi ed Informatica del C.N.R., Viale Manzoni 30, 00185 RomaSearch for more papers by this author Lucio Bianco, Lucio Bianco Istituto di Analisi dei Sistemi ed Informatica del C.N.R., Viale Manzoni 30, 00185 RomaSearch for more papers by this authorSalvatore Ricciardelli, Salvatore Ricciardelli Istituto di Analisi dei Sistemi ed Informatica del C.N.R., Viale Manzoni 30, 00185 RomaSearch for more papers by this authorGiovanni Rinaldi, Giovanni Rinaldi Istituto di Analisi dei Sistemi ed Informatica del C.N.R., Viale Manzoni 30, 00185 RomaSearch for more papers by this authorAntonio Sassano, Antonio Sassano Istituto di Analisi dei Sistemi ed Informatica del C.N.R., Viale Manzoni 30, 00185 RomaSearch for more papers by this author First published: April 1988 https://doi.org/10.1002/1520-6750(198804)35:2 3.0.CO;2-VCitations: 73AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onFacebookTwitterLinked InRedditWechat Abstract In this article we consider the problem of minimizing the maximum completion time of a sequence of n jobs on a single machine. Nonzero ready times and sequence-dependent processing times are allowed. Upper bounds, lower bounds, and dominance criteria are proposed and exploited in a branch-and-bound algorithm. Computational results are given. Citing Literature Volume35, Issue2April 1988Pages 177-184 RelatedInformation