Learn More
This paper considers the scheduling problem of a single semiconductor batch-processing machine with job release times, non-identical job sizes, distinct due dates, and weights to minimize the total weighted tardiness. A batch-processing machine can process several jobs simultaneously as a batch, and the processing time of a batch is equal to the longest(More)
This paper considers the scheduling problem observed in chip sorting operation of LED manufacturing , where each lot (job) with release time have four operations to be processed on a set of processing stages without predetermined necessary route. Each stage has one and more identical sorting machines. The sorting machines scheduling problem can be treated(More)
This paper considers the problem of scheduling n jobs on a single machine to minimize the total weighted completion time. Each job has a release time, a processing time and a weight. For the problem, we present a bi-direction branching scheme based on branch and bound method, called bi-direction branch and bound (BDBAD), which incorporates forward-driven(More)
  • 1