Optimal allocation and processing time decisions on non-identical parallel CNC machines: ε{lunate}-constraint approach

European Journal of Operational Research

Volumn 183, Issue 2, 2007, Pages 591-607

  Gurel, Sinan ^a   Akturk, M Selim ^a  

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

Controllable processing times; Makespan; Manufacturing cost; Non identical parallel machines; Scheduling

Indexed keywords

ALGORITHMS; COMPUTER CONTROL; DECISION MAKING; NUMERICAL CONTROL SYSTEMS; PROBLEM SOLVING; SCHEDULING;

CONTROLLABLE PROCESSING TIMES; COST BOUNDING PROPERTIES; MANUFACTURING COST; NON-IDENTICAL PARALLEL MACHINES;

OPERATIONS RESEARCH;

EID: 34249981704     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.10.024     Document Type: Article

References (20)

1. Bazaraa M.S., Sherali H.D., and Shetty C.M. Nonlinear Programming: Theory and Algorithms (1993), Wiley, New York
2. Davis E., and Jaffe J.M. Algorithms for scheduling tasks on unrelated processors. Journal of the Association for Computing Machinery 28 (1981) 721-736
3. Della Croce F., and T'kindt V. A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem. Journal of the Operational Research Society 53 (2002) 1275-1280
4. Della Croce F., Ghirardi M., and Tadei R. Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems. Journal of Heuristics 10 (2004) 89-104
5. Floudas C.A. Nonlinear and Mixed-Integer Optimization (1995), Oxford University Press, New York
6. Hitomi K. Manufacturing Systems Engineering: A Unified Approach to Manufacturing Technology and Production Management (1979), Taylor and Francis, London
7. Hoogeveen H. Multicriteria scheduling. European Journal of Operational Research 167 (2005) 592-623
8. Hoogeveen H., and Woeginger G.J. Some comments on sequencing with controllable processing times. Computing 68 (2002) 181-192
9. Jansen K., and Mastrolilli M. Approximation schemes for parallel machine scheduling problems with controllable processing times. Computers and Operations Research 31 (2004) 1565-1581
10. Karabati S., and Kouvelis P. Flow-line scheduling problem with controllable processing times. IIE Transactions 29 (1997) 1-14
11. Kayan R.K., and Akturk M.S. A new bounding mechanism for the CNC machine scheduling problems with controllable processing times. European Journal of Operational Research 167 (2005) 624-643
12. Kesavan P., Allgor R.J., Gatzke E.P., and Barton P.I. Outer approximation algorithms for separable non-convex mixed-integer nonlinear programs. Mathematical Programming 100 (2004) 517-535
13. Lamond B.F., and Sodhi M.S. Using tool life models to minimize processing time on a flexible machine. IIE Transactions 29 (1997) 611-621
14. Mastrolilli M. Notes on max flow time minimization with controllable processing times. Computing 71 (2003) 375-386
15. Ow P.S., and Morton T.E. Filtered beam search in scheduling. International Journal of Production Research 26 (1988) 35-62
16. Sodhi M.S., Lamond B.F., Gautier A., and Noël M. Heuristics for determining economic processing rates in a flexible manufacturing system. European Journal of Operational Research 129 (2001) 105-115
17. T'kindt V., and Billaut J.-C. Multicriteria Scheduling: Theory, Models and Algorithms. second ed. (2006), Springer, Berlin
18. Trick M.A. Scheduling multiple variable-speed machines. Operations Research 42 (1994) 234-248
19. Van Wassenhove L.N., and Baker K.R. A bicriterion approach to time/cost tradeoffs in sequencing. European Journal of Operational Research 11 (1982) 48-54
20. Vickson R.G. Two single-machine sequencing problems involving controllable job processing times. AIEE Transactions 12 (1980) 258-262