This article addresses the job-shop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequence-dependent setup times and removal times. The processing of each job includes at most two operations that have to be non-preemptive. Machine routes may differ from job to job. If all setup and removal times are equal to zero, this problem is polynomially s...

A prostate treatment immobilization system was evaluated with respect to setup errors and efficiency for a specific treatment setup. Prostate patients were treated in the prone position with a rectal catheter using the NOMOS intensity modulated radiotherapy system. Immobilization and setup consisted of a Vac-Loktrade mark bag (MED-TEC, Orange City, IO) fitted within a registration carrier box w...

This paper deals with the single machine multi-product lot scheduling problem in which defective items are produced in any production run of each product. We have adopted the common cycle scheduling policy and assumed that the setup times for production of each product can be non-zero. Further, we have assumed that defective items will be reworked and the inspection costs during the normal prod...

In this paper, the researchers have investigated a Concatenated Robot Move (CRM) sequence problem and Minimal Part Set (MPS) schedule problem with different setup times for two-machine robotic cell. They have focused on simultaneous solving of CRM sequence and MPS schedule problems with different loading and unloading times. They have applied a Simulated Annealing (SA) algorithm to provide a go...

New complexity results are derived. It is shown that the two machine flow shop problem with a single server is NP-hard if either the setup times or the processing times are constant. Furthermore, polynomial algorithms are given for special cases in which both setup times and processing times are constant. Flow-shop problems with a single server are generalizations of classical flow-shop problem...

We consider the dynamic lot-sizing problem with finite capacity and possible lost sales for a process that could be kept warm at a unit variable cost for the next period t + 1 only if more than a threshold value Qt has been produced and would be cold, otherwise. Production with a cold process incurs a fixed positive setup cost, Kt and setup time, St, which may be positive. Setup costs and times...

The problem addressed in this paper is scheduling jobs on unrelated parallel machines with sequence-dependent setup times to minimize the maximum completion time (i.e., the makespan). This problem is NP-hard even without including setup times. Adding sequence-dependent setup times adds another dimension of complexity to the problem and obtaining optimal solutions becomes very difficult especial...

This paper presents an enhanced heuristic for minimizing the makespan of the ow shop scheduling problem with sequence-dependent setup times. The procedure transforms an instance of the problem into an instance of the traveling salesman problem by introducing a cost function that penalizes for both large setup times and bad tness of schedule. This hybrid cost function is an improvement over earl...

This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...

We consider the problem of scheduling jobs in a hybrid job shop We use the term hybrid to indicate that we consider a lot of extensions of the classic job shop such as transportation times multiple resources and setup times The Shifting Bottleneck procedure can be generalized to deal with those extensions We test this approach for an assembly shop In this shop we study the in uence of static an...