engleski

SGP Heuristics for One Machine Scheduling Problem

Each of N jobs is to be processed on a single machine. Only one job can be processed at any given time. Each switch from one job to another requires sequence dependent setup time. The objective is to find a processing order which minimizes the makespan. Let call this problem the OMSC problem. OMSC problem is defined as a grouping problem. A heuristics called SGP Heuristics and based on spectral graph partitioning is presented with some computational results.

single machine scheduling problem; sequence dependent setup; grouping problem; heuristics

nije evidentirano