Job selection in a heavily loaded shop

Computers and Operations Research

Volumn 24, Issue 2, 1997, Pages 141-145

  Ghosh, Jay B ^a  

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; JOB ANALYSIS; OPTIMIZATION; POLYNOMIALS;

HEAVILY LOADED SHOP; JOB SELECTION; JOB WEIGHTS;

HEURISTIC PROGRAMMING;

EID: 0031075465     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(96)00045-7     Document Type: Article

References (8)

1. Slotnick, S.A. and Morton, T.E., Selecting jobs for a heavily loaded shop with lateness penalties. Computers Ops Res., 1996, 23, 131-140.
2. Pourbabai, B., A short term production planning and scheduling model. Engng Costs Product. Econ., 1989, 18, 159-167.
3. Pourbabai, B., Optimal selection of orders in a just-in-time manufacturing environment: a loading model for a computer integrated manufacturing system. Int. J. Comput. Integrated Manufact., 1992, 5, 38-44.
4. D. L. Woodruff, Subcontracting when there are setups, deadline and tooling costs.Proceedings of Intelligent Scheduling Systems Symposium, eds W. T. Scherer and D. E. Brown, pp. 337-353, 1992.
5. Wester, F.A.W., Wijngaard, J. and Zijm, W.H.M., Order acceptance strategies in a production-to-order environment with setup times and due-dates. Int. J. Product. Res., 1992, 30, 1313-1326.
6. De, P., Ghosh, J.B. and Wells, C.E., Job selection and sequencing on a single machine in a random environment. Eur. J. Opl Res., 1993, 70, 425-431.
7. Garey, M. R. and Johnson, D. S., Computers and Intractability. Freeman, San Francisco, 1979.
8. Horowitz, E. and Sahni, S., Fundamentals of Computer Algorithms. Computer Science Press, Potomac, 1978.