Single machine scheduling with time deteriorating job values

Journal of the Operational Research Society

Volumn 59, Issue 1, 2008, Pages 105-118

  Raut, S ^a   Gupta, J N D ^b   Swami, S ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^b UNIVERSITY OF ALABAMA IN HUNTSVILLE   (United States)

Author keywords

Capacity constraint; Deteriorating job values; Empirical results; Heuristics; Movie theatre scheduling; NP hardness; Single machine

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC ALGORITHMS; MARKETING; OPTIMIZATION; PARAMETER ESTIMATION; POLYNOMIALS; SCHEDULING; WEB SERVICES;

CAPACITY CONSTRAINT; DETERIORATING JOB VALUES; EMPIRICAL RESULTS; MOVIE THEATRE SCHEDULING; SINGLE MACHINES;

JOB ANALYSIS;

EID: 37149042343     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602303     Document Type: Article

References (15)

1. Alidaee B (1991). Single machine scheduling with nonlinear cost functions. Comput Opns Res 18: 317-332.
2. Alidaee B (1993). Numerical methods for single machine scheduling with non-linear cost functions to minimize total cost. J Opl Res Soc 44: 125-132.
3. Fisher ML and Krieger AM (1981). Analysis of a linearization heuristic for single-machine scheduling to maximize profit. Working Paper, Department of Decision Sciences, The Wharton School, University of Pennsylvania.
4. Fisher ML and Krieger AM (1984). Analysis of a linearization heuristic for single-machine scheduling to maximize profit. Math Programming 28: 218-225.
5. Fleischmann M et al (1997). Quantitative models for reverse logistics: a review. Eur J Opl Res 103: 1-17.
6. Garey MR and Johnson DS (1979). Computers and Intractability - A Guide to the Theory of NP-Completeness. Freeman: San Francisco, CA.
7. Lawler EL (1976). Combinatorial Optimization: Networks and Metriods. Holt, Rinehart and Winston: New York.
8. Lawler EL (1977). A pseudo-polynomial algorithm for sequencing jobs to minimize total tardiness. Ann Discrete Math 1: 331-342.
9. Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (1993). Sequencing and scheduling: algorithm and complexity. In: Graves SC, Rinnooy Kan AHG and Zipkin PH (eds). Handbooks in Operations Research and Management Science, Volume 4: Logistics of Production and Inventory. North-Holland, Amsterdam, pp 445-522.
10. Lenstra JK, Rinnooy Kan AHG and Brucker P (1977). Complexity of machine scheduling problems. Ann Discrete Math 1: 343-362.
11. Smith WE (1956). Various optimizers for single-stage production. Naval Res Logistics Quart. 3: 59-66.
12. Sousa JP and Wolsey LA (1992). A time-index formulation of non-preemptive single machine scheduling problems. Math Programming 54: 353-367.
13. Swami S, Jehoshua E and Charles BW (1999). SilverScreener: a modeling approach to movie screens management. Market Sci (Special Issue on Managerial Decision Making) 18: 352-372.
14. Voutsinas TG and Pappis CP (2002). Scheduling jobs with values exponentially deteriorating over time. Int J Product Econ 79: 163-169.
15. Xia Y and Tse D (2000). Survey of single machine scheduling with application to web object transmission. Department of Electrical Engineering and Computer Science, University of California: Berkeley.