2 MACHINE OPEN SHOP SCHEDULING PROBLEM TO MINIMIZE AN ARBITRARY MACHINE USAGE REGULAR PENALTY-FUNCTION

Natalia V. Shakhlevich

doi:10.1016/0377-2217(93)90250-Q

2 MACHINE OPEN SHOP SCHEDULING PROBLEM TO MINIMIZE AN ARBITRARY MACHINE USAGE REGULAR PENALTY-FUNCTION

1993-11-01

9

PRE

AI

N

Natalia V. Shakhlevich

V

Vitaly A. Strusevich

DOI：10.1016/0377-2217(93)90250-Q

Original

Original request for help

Save

Abstract

En 中文

The paper present a linear-time algorithm for solving the two machine open shop scheduling problem to minimize an arbitrary regular penalty function depending on the lengths of periods during which the machines are used. Both the preemptive and the nonpreemptive cases of the problem are considered.

Keywords:

OPEN SHOP SCHEDULING

MACHINE USAGE PENALTY FUNCTION

LINEAR-TIME ALGORITHM

2 MACHINE OPEN SHOP SCHEDULING PROBLEM TO MINIMIZE AN ARBITRARY MACHINE USAGE REGULAR PENALTY-FUNCTION

Abstract

Journal

Organization