Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem

Expert Systems with Applications

Volumn 37, Issue 9, 2010, Pages 6594-6601

  Lee, Wen Chiung ^a   Chen, Shiuan Kang ^a   Wu, Chin Chia ^a  

^a FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

Scheduling; Two agent; Two machine flowshop

Indexed keywords

BRANCH AND BOUND METHOD; HEURISTIC ALGORITHMS; OPTIMAL SYSTEMS; OPTIMIZATION; SCHEDULING; SIMULATED ANNEALING;

BRANCH-AND-BOUND ALGORITHMS; COMPUTATIONAL RESULTS; NEAR-OPTIMAL SOLUTIONS; NUMBER OF TARDY JOBS; SCHEDULING PROBLEM; SIMULATED ANNEALING ALGORITHMS; TWO AGENTS; TWO-MACHINE FLOWSHOP;

JOB SHOP SCHEDULING;

EID: 79956070862     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2010.02.125     Document Type: Article

References (21)

1. Agnetis, A., Mirchandani, P. B., Pacciarelli, D., & Pacifici, A. (2004). Scheduling problems with two competing agents. Operations Research, 52, 229-242. (Pubitemid 40000802)
2. Agnetis, A., Pacciarelli, D., & Pacifici, A. (2007). Multi-agent single machine scheduling. Annals of Operations Research, 150, 3-15.
3. Baker, K. R., & Smith, J. C. (2003). A multiple-criterion model for machine scheduling. Journal of Scheduling, 6, 7-16.
4. Ben-Arieh, D., & Maimon, O. (1992). Annealing method for PCB assembly scheduling on two sequential machines. International Journal of Computer Integrated Manufacturing, 5, 361-367.
5. Cadambi, B. V., & Sathe, Y. S. (1993). Two-machine flowshop scheduling to minimise mean flow time. Opsearch, 30, 35-41.
6. Chan, K. Y., Kwong, C. K., & Luo, X. G. (2009). Improved orthogonal array based simulated annealing for design optimization. Expert Systems with Applications, 36, 7379-7389.
7. Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2006). Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theoretical Computer Science, 362, 273-281. (Pubitemid 44374206)
8. Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2008). Multi-agent scheduling on a single machine with max-form criteria. European Journal of Operational Research, 188, 603-609.
9. Chou, F. D., Wang, H. M., & Chang, P. C. (2008). A simulated annealing approach with probability matrix for semiconductor dynamic scheduling problem. Expert Systems with Applications, 35, 1889-1898.
10. Curiel, I., Pederzoli, G., & Tijs, S. (1989). Sequencing games. European Journal of Operational Research, 40, 344-351.
11. Hamers, H., Borm, P., & Tijs, S. (1995). On games corresponding to sequencing situations with ready times. Mathematical Programming, 70, 1-13.
12. Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness. Research Report 43, Management Science Research Project, University of California, Los Angeles.
13. Kim, K., Paulson, B. C., Petrie, C. J., & Lesser, V. R. (1999). Compensatory negotiation for agent-based schedule coordination. CIFE Working Paper #55, Stanford University, Stan ford, CA.
14. Kirkpatrick, S., Gelatt, C., & Vecchi, M. (1983). Optimization by simulated annealing. Science, 20(4598), 671-680.
15. Liu, P., & Tang, L. (2008). Two-agent scheduling with linear deteriorating jobs on a single machine. Lecture Notes in Computer Science, 5092, 642-650.
16. Ng, C. T., Cheng, T. C. E., & Yuan, J. J. (2006). A note on the complexity of the problem of two-agent scheduling on a single machine. Journal of Combinatorial Optimization, 12, 387-394.
17. Pan, J. C. H., & Fan, E. T. (1997). Two-machine flow-shop scheduling to minimize total tardiness. International Journal of Systems Science, 28, 405-414.
18. Patra, S., Goswami, S. K., & Goswami, B. (2009). Fuzzy and simulated annealing based dynamic programming for the unit commitment problem. Expert Systems with Applications, 36, 5081-5086.
19. Pinedo, M. L. (2002). Scheduling theory: Algorithms and system (2nd ed.). New Jersey: Prentice-Hall.
20. Schultz, D., Oh, S.-H., Grecas, C. F., Albani, M., Sanchez, J., Arbib, C., et al. (2002). A QoS concept for packet oriented SUMTS services. In Proceedings of the 1st mobile summit, Thessaloniki, Greece.
21. Yuan, J. J., Shang, W. P., & Feng, Q. (2005). A note on the scheduling with two families of jobs. Journal of Scheduling, 8, 537-542. (Pubitemid 41442644)