Optimal job-shop scheduling with random operations and cost objectives

International Journal of Production Economics

Volumn 76, Issue 2, 2002, Pages 147-157

  Golenko Ginzburg, Dimitri ^a   Gonik, Aharon ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Coordinate descent search algorithm; Job shop problem; Pairwise comparison; Random operation; Total penalty and storage expenses

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; COST BENEFIT ANALYSIS; DECISION MAKING; HEURISTIC METHODS; JOB ANALYSIS; MATHEMATICAL MODELS; OPTIMIZATION; RANDOM PROCESSES;

JOB-SHOP SCHEDULING;

SCHEDULING;

EID: 0037149316     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(01)00140-2     Document Type: Article

References (13)

1. Minimizing the expected makespan in stochastic flow shops
2. Stochastic scheduling with release dates and due dates
3. Scheduling of stochastic tasks on two parallel processors
4. The largest variance first policy in some stochastic scheduling problems
5. Scheduling jobs with stochastic processing requirements on parallel machines to minimize makespan or flow time
6. Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
7. Industrial job-shop scheduling with random operations and different priorities
8. Using "look-ahead" techniques in job-shop scheduling with random operations
9. A generalized control model for man-machine production systems with disturbances
10. Scheduling the general job-shop
11. Heuristics in job-shop scheduling