Two-agent scheduling with linear deteriorating jobs on a single machine

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5092 LNCS, Issue , 2008, Pages 642-650

  Liu, Peng ^a   Tang, Lixin ^a  

^a NORTHEASTERN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DETERIORATION; POLYNOMIAL APPROXIMATION; SCHEDULING;

BASIC PROPERTIES; COMBINATORICS; DETERIORATING JOBS; INTERNATIONAL CONFERENCES; MAKESPAN; MAXIMUM LATENESS; OBJECTIVE FUNCTION; OBJECTIVE FUNCTIONS; OPTIMAL ALGORITHMS; POLYNOMIAL-TIME; PROCESSING TIME; SCHEDULING PROBLEMS; SINGLE MACHINES; TOTAL COMPLETION TIME;

AGENTS;

EID: 48249127882     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69733-6_63     Document Type: Conference Paper

References (14)

1. Agnetis, A., Mirchandani, P.B., Pacciarelli, D., Pacifici, A.: Scheduling Problems with Two Competing Agents. Operations Research 52, 229-242 (2004)
2. Agnetis, A., Pacciarelli, D., Pacifici, A.: Multi-agent Single Machine Scheduling. Annals of Operations Research 150, 3-15 (2007)
3. Alidaee, B., Womer, N.K.: Scheduling with Time Dependent Processing Times: Review and Extensions. Journal of the Operational Research Society 50, 711-720 (1999)
4. Baker, K.R., Smith, J.C.: A multiple-criterion Model for Machine Scheduling. Journal of Scheduling 6, 7-16 (2003)
5. Browne, S., Yechiali, U.: Scheduling Deteriorating Jobs on a Single Processor. Operations Research 38, 495-498 (1990)
6. Cheng, T.C.E., Ding, Q., Lin, B.M.T.: A Concise Survey of Scheduling with Time-Dependent Processing Times. European Journal of Operational Research 152, 1-13 (2004)
7. Cheng, T.C.E., Ng, C.T., Yuan, J.J.: Multi-agent Scheduling on a Single Machine to Minimize Total Weighted Number of Tardy Jobs. Theoretical Computer Science 362, 273-281 (2006)
8. Cheng, T.C.E., Ng, C.T., Yuan, J.J.: Multi-agent Scheduling on a Single Machine with Max-Form Criteria. European Journal of Operational Research 188, 603-609 (2008)
9. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and Approximation in Deterministic Sequencing and Scheduling Theory: a Survey. Annals of Discrete Mathematics 5, 287-326 (1979)
10. Gupta, J.N.D., Gupta, S.K.: Single Facility Scheduling with Nonlinear Processing Times. Computers and Industrial Engineering 14, 387-393 (1988)
11. Mosheiov, G.: Scheduling Jobs under Simple Linear Deterioration. Computers and Operations Research 21, 653-659 (1994)
12. Ng, C.T., Cheng, T.C.E., Bachman, A., Janiak, A.: Three Scheduling Problems with Deteriorating Jobs to Minimize the Total Completion Time. Information Processing Letters 81, 327-333 (2002)
13. Wu, C.C., Lee, W.C.: Scheduling Linear Deteriorating Jobs to Minimize Makespan with an Availability Constraint on a Single Machien. Information Processing Letters 87, 89-93 (2003)
14. Yuan, J.J., Shang, W.P., Feng, Q.: A Note on the Scheduling with Two Families of Jobs. Journal of Scheduling 8, 537-542 (2005)