Typically, general job shop scheduling problems assume that working times of machines are equal, for instance eight hours a day. However, in real factories, these working times are different because the machines may have different processing speeds, or they may require maintenance. That is, one machine may need to be operated only half day whereas other machines may have to be operated for the ...

Semiconductor manufacturing systems consist of highly complex and constrained processes owing to the requirement for high-quality wafers dynamic customer orders. This study focuses on waiting time constraints achieve wafers, with missing operations, manufacture different types orders, which are common scheduling requirements in semiconductor systems. Waiting limit times between consecutive mach...

This paper considers the scheduling problem of parallel batch processing machines with non-identical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-in...

Scheduling is a combinatorial problem with important impact on both industry and commerce. If it is performed well it yields time and efficiency benefits and hence reduces costs. Genetic Algorithms have been applied to solve several types of scheduling problems; Flow Shop, Resource, Staff and Line Balancing have all been tackled. However Jobshop Scheduling is the most common problem of interest...

The paper addresses the form of the graphical interface for an IDSS used for scheduling small-batch production. The IDSS has been developed to aid inferential processing by bringing “visibility” to those attributes experienced schedulers use to schedule jobs on the shop floor. From the patterns in the values of the attributes, schedulers can see interactions and dependencies between jobs.

Flow-shop scheduling problem (FSP) deals with the scheduling of a set of jobs that visit a set of machines in the same order. The FSP is NP-hard, which means that an efficient algorithm for solving the problem to optimality is unavailable. To meet the requirements on time and to minimize the make-span performance of large permutation flow-shop scheduling problems in which there are sequence dep...

In simple flow shop problems, each machine operation center includes just one machine. If at least one machine center includes more than one machine, the scheduling problem becomes a flexible flow-shop problem. Recently, group scheduling has also been proposed and discussed. In the group scheduling, each job belongs to a specific group and all the jobs are processed group by group. In this pape...

In this work, multicriteria decision making objective for flow shop scheduling with sequence dependent set up time and due dates have been developed. Multicriteria decision making objective includes total tardiness, total earliness and makespan simultaneously which is very effective decision making for scheduling jobs in modern manufacturing environment. As problem of flow shop scheduling is NP...

Real-time scheduling of semiconductor manufacturing operations, semiconductor test operations in particular, is complicated due to the following factors; multi-head resources, multi-level hardware dependency, temperature and hardware criteria, dynamic determination of processing time and indexing time, batch processing and re-entrant flow. A first-ofits-kind, object oriented (OO), discrete even...