Non-preemptive two-machine open shop scheduling with non-availability constraints

Joachim Breit; Günter Schmidt; Vitaly A. Strusevich

doi:10.1007/s001860200267

ScienceGate Book Chapters

JOURNAL ARTICLE

Non-preemptive two-machine open shop scheduling with non-availability constraints

Joachim Breit Günter Schmidt Vitaly A. Strusevich

Year: 2003 Journal: Mathematical Methods of Operations Research Vol: 57 (2)Pages: 217-234 Publisher: Springer Science+Business Media

DOI: 10.1007/s001860200267

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science Scheduling (production processes) Preemption Mathematical optimization Parallel computing Distributed computing Mathematics Operating system

Metrics

Cited By

1.51

FWCI (Field Weighted Citation Impact)

Refs

0.84

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Scheduling and Optimization Algorithms

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Advanced Manufacturing and Logistics Optimization

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Optimization and Search Problems

Physical Sciences → Computer Science → Computer Networks and Communications

Non-preemptive two-machine open shop scheduling with non-availability constraints

Metrics

Citation History

Topics

Related Documents

Non-Preemptive Open Shop Scheduling Considering Machine Availability

Minimizing the makespan in the non-preemptive job-shop scheduling with limited machine availability

Disjunctive and time-indexed formulations for non-preemptive job shop scheduling with resource availability constraints

Two-machine open shop scheduling with an availability constraint

Scheduling hybrid flow shop problem with non-fixed availability constraints