we consider online scheduling of jobs with specic release time on m identical machines. each job has a weight and a size; the goal is maximizing total weight of completed jobs. at release time of a job it must immediately be scheduled on a machine or it will be rejected. it is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contr...

The just-in-time production philosophy has led to a growing interest in scheduling problems considering both earliness and tardiness penalties. Most publications considering these so-called non-regular objective functions are devoted to single machine problems. In the case of multi-machine problems, there are some papers dealing with parallel machine problems. However, for multi-operation sched...

Article history: Received 19 January 2009 Received in revised form 17 April 2009 Accepted 30 April 2009 Available online 7 May 2009

Four lemmas, which constitute the theoretical foundation necessary to determine optimal control strategies for a class of single machine family scheduling problems, are presented in this technical report. The scheduling problem is characterized by the presence of sequence-dependent batch setup and controllable processing times; moreover, the generalized due-date model is adopted in the problem....

Many defects in manufacturing system are caused by human resources that show the significance of the human resources in manufacturing systems. Most manufacturers attempt to investigate the human resources in order to improve the work conditions and reduce the human error by providing a proper work-rest schedule. On the other hand, manufacturer deal with machine scheduling based on demand and wo...

This paper deals with a single machine scheduling problem with availability constraints. The jobs are splitable and lower bound on the size of each sub-job is imposed. The objective is to find a feasible schedule that minimizes the makespan. The proposed scheduling problem is proved to be NP-hard in the strong sense. Some effective heuristic algorithms are then proposed. Additionally, computati...

In this paper, we study a supply chain scheduling problem that simultaneously considers production scheduling and product delivery.  jobs have to be scheduled on a single machine and delivered to  customers for further processing in batches. The objective is to minimize the sum of the total weighted number of tardy jobs and the delivery costs. In this paper, we present a heuristic algorithm (HA...