Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs

Discrete Applied Mathematics

Volumn 94, Issue 1-3, 1999, Pages 263-285

  Józefowska, Joanna ^a   Mika, Marek ^a   Rózycki, Rafał ^a   Waligóra, Grzegorz ^a   Wȩglarz, Jan ^a  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0043210849     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00025-6     Document Type: Article

References (20)

1. E.H.L. Aarts, J.H.M. Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing, Wiley, Chichester, 1989.
2. J. Błazewicz, K.H. Ecker, G. Schmidt, J. Weglarz, Scheduling in Computer and Manufacturing Systems, Second ed., Springer, Berlin, 1994.
3. J. Błazewicz, W. Kubiak, J. Szwarcfiter, Scheduling independent fixed-type tasks, in: R. Slowinski, J. Weglarz (Eds.), Advances in Project Scheduling, Elsevier, Amsterdam, 1989.
4. V. Černy Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm, J. Optim. Theory Appl. 45/1 (1985) 41-51.
5. L. Davis Applying adaptive algorithms to epistatic domains, Proceedings of the International Joint Conference on Artificial Intelligence, 1985, pp. 162-164.
6. M. Dror, H.J. Stern, J.K. Lenstra, Parallel machine scheduling with processing rates dependent on number of jobs in operation, Manage. Sci. 33 (8) (1987) 1001-1009.
7. F. Glover, Tabu Search - part 1, ORSA J. Comput. 1 (1989) 190-206.
8. F. Glover, Tabu Search - part 2, ORSA J. Comput. 2 (1990) 4-32.
9. A. Hertz, D. De Werra, The Tabu Search Metaheuristic: how we used it, ORWP 88/13, Ecole Polytechniquue Federale de Lausanne, 1988.
10. J, Józefowska, M. Mika, J. Wȩglarz, A simulated annealing algorithm for some class of discrete-continuous scheduling problems, Computational Methods in Science and Technology, vol. 2, Scientific Publishers OWN, Poznań, 1996.
11. J. Józefowska, M. Mika, R. Różycki, G. Waligóra, J. Wȩglarz, Local search metaheuristics for discrete-continuous scheduling problem, Eur. J. Oper. Res 107 (2) (1998) 354-370.
12. J. Józefowska, J. Weglarz, On a methodology for discrete-continuous scheduling, Eur. J. Oper. Res 107 (2) (1998) 338-353.
13. S. Kirkpatrick, C.D. Jr. Gelatt, M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671-680.
14. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, E. Teller, Equations of state calculations by fast computing machines, J. Chem Phys 21 (1953) 1087-1092.
15. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer, Berlin, 1992.
16. I.H. Osman, C.N. Potts, Simulated annealing for permutation flowshop scheduling, Omega 17/6 (1989) 551-557
17. J.H. Patterson, A comparison of exact approaches for solving the multiple constrained resource, project scheduling problem, Manage. Sci 30 (7) (1984) 854-867.
18. M. Widmer, Job shop scheduling with tooling constraints: a tabu search approach, ORWP 89/22, Ecole Polytechnique Federale de Lausanne, 1989.
19. J. De Wit, W. Herroelen. An evaluation of microcomputer-based software packages for project management, Eur. J. Oper. Res. 49 (1) (1990) 102-132.
20. P.J.M. Van Larrhoven, E.H.L. Aarts, Simulated Annealing: Theory and Applications, Kluwer Academic Publishers, Dordrecht, 1987.