Scheduling two parallel semiautomatic machines to minimize machine interference

Computers and Operations Research

Volumn 23, Issue 10, 1996, Pages 945-956

  Koulamas, Christos P ^a  

^a FLORIDA INTERNATIONAL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; EFFICIENCY; INTERFERENCE SUPPRESSION; OPERATIONS RESEARCH; OPTIMIZATION; PERFORMANCE; ROBOTS;

IDLE TIMES;

SCHEDULING;

EID: 0030269665     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(96)00011-1     Document Type: Article

References (8)

1. K. Stecke and J. Aronson, Review of operator/machine interference models. Int. J. Prod. Res. 23, 129-151 (1985).
2. V. K. Sahney, Single-server, two-machine sequencing with switching time. Opns Res. 20, 24-26 (1972).
3. C. P. Koulamas and M. L. Smith, Look-ahead scheduling for minimizing machine interference. Int. J. Prod. Res. 26, 1523-1533 (1988).
4. C. K. So, Some heuristics for scheduling jobs on parallel machines with setups. Mgmt Sci. 36, 467-475 (1990).
5. G. Dobson and U. S. Karmarkar, Simultaneous resource scheduling to minimize weighted flow times. Opns Res. 37, 592-600 (1989).
6. S. R. Lawrence and T. E. Morton, Resource-constrained multi-project scheduling with tardy costs: comparing myopic, bottleneck and resource pricing heuristics. Eur. J. Opl Res. 64, 168-187 (1993).
7. M. R. Garey and D. S. Johnson, Computer and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1975).
8. P. S. Ow and T. E. Morton, The single machine early/tardy problem. Mgmt Sci. 35, 177-191 (1989).