Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem

Publisher Website
Google Scholar
Abstract
This note is concerned with some essential characteristics of the feasible solutions for a job-shop scheduling problem in which the jobs are constrained by fixed starting times and due dates. These characteristics are related to the scheduling order of operations on each machine and to the fixed starting and completion times for each operation. We present the basic principles enabling one to define these characteristics and propose a procedure for finding them.

This publication has 0 references indexed in Scilit: