Scheduling problem with multi-purpose parallel machines

Discrete Applied Mathematics

Volumn 164, Issue PART 1, 2014, Pages 313-319

  Rodrigues, Rosiane De Freitas ^a   Dourado, Mitre Costa ^b   Szwarcfiter, Jayme Luiz ^b  

^a FEDERAL UNIVERSITY OF AMAZONAS   (Brazil)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Algorithms; Scheduling theory; Unit penalty function; Unit time jobs

Indexed keywords

IDENTICAL PARALLEL MACHINES; MULTI-PURPOSE MACHINES; NETWORK FLOW TECHNIQUES; PENALTY FUNCTION; SCHEDULING THEORY; TIME WINDOW CONSTRAINT; TOTAL WEIGHTED NUMBER OF TARDY JOBS; UNIT TIME JOBS;

ALGORITHMS; BUSINESS MACHINES; SCHEDULING;

SCHEDULING ALGORITHMS;

EID: 84893758428     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2011.11.033     Document Type: Conference Paper

References (16)

1. R. Ahuja, T. Magnanti, and J. Orlin Network Flows: Theory, Algorithms, and Applications 1993 John Wiley
2. P. Baptiste, P. Brucker, S. Knust, and V. Timkovsky Ten notes on equal-execution-time scheduling 4OR 2 2004 111 127
3. P. Brucker Scheduling Algorithms fourth ed. 2004 Springer-Verlag
4. P. Brucker, B. Jurisch, and A. Krämer Complexity of scheduling problems with multi-purpose machines Annals of Operations Research 70 1997 57 73 J.C. Baltzer
5. P. Brucker, S. Knust, Complexity results for scheduling problems, 2009. Available in: http://www.mathematik.uni-osnabrueck.de/research/OR/class (last access in: February, 2010).
6. P. Brucker, S.A. Kravchenko, Scheduling jobs with release times on parallel machines to minimize total tardiness, Universität Osnabrück, Fachbereich Mathematik/Informatik, 2005.
7. P. Brucker, and S.A. Kravchenko Scheduling jobs with equal processing times and time windows on identical parallel machines Journal of Scheduling 11 2008 229 237
8. J. Bruno, E. Coffman Jr., and R. Sethi Scheduling independent tasks to reduce mean finishing time Communications of the ACM 17 1974 382 387
9. M. Dourado, R. Rodrigues, and J. Szwarcfiter Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs Annals of Operations Research 169 1 2009 81 91 Springer-Verlag
10. M. Garey, and D. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 W. H. Freeman and Company
11. R. Graham, E. Lawler, J. Lenstra, and A. Rinnooy-Kan Optimization and approximation in deterministic sequencing and scheduling: a survey Annals of Discrete Mathematics 5 1979 287 326 Springer-Verlag
12. J. Hoogeveen, S. van de Velde, and B. Veltman Complexity of scheduling multiprocessor tasks with prespecified processor allocations Discrete Applied Mathematics 55 3 1994 259 272
13. W. Horn Minimizing average flow time with parallel machines Operations Research 21 1973 846 847
14. J. Jackson, Scheduling a production line to minimize maximum tardiness, Management Science Research Project, Research Report 43, 1955, University of California, Los Angeles.
15. J. Moore A n job, one machine sequencing algorithm for minimizing the number of late jobs Management Science 15 1968 102 109
16. R. Rodrigues, Caracterizações e algoritmos para problemas clássicos de escalonamento, Doctoral Thesis, Computer and Systems Engineering, COPPE, UFRJ, Rio de Janeiro, Brazil, 2009.