This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...

in this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. this study seems utterly new and it is applicable to any performance measure based on the completion time. the in...

open-pit production scheduling (opps) problem focuses on determining a block sequencing and scheduling to maximize net present value (npv) of the venture under constraints. the scheduling model is critically sensitive to the economic value volatility of block, block weight, and operational capacity. in order to deal with the opps uncertainties, various approaches can be recommended. robust opti...

In forming a complete schedule for jobs (such as instructions on a processor capable of multiple instruction issue), two independent operations occur: sequencing of the jobs and scheduling those prioritized jobs. This paper discusses the importance of the distinction between sequencing and scheduling, and gives a number of examples based on instruction scheduling to clarify the differences. It ...

The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...

In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...

Scheduling problems typically deal with activity sequencing and resource allocation while the problem of activity selection is assumed to be resolved before scheduling. To increase flexibility of scheduling systems in complex environments, it is possible to include activity selection, for example decisions about alternative process routes, in the scheduling problem. This could be realized by as...

this article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. the objective is to minimize the makespan for a given set of jobs in the system. this problem class is np-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. a number of test problems are randomly ge...