proper scheduling of tasks leads to optimum using of time and resources, inorder to obtaining best result. one of the most important and complicatedscheduling problems is open shop scheduling problem. there are n jobs in openshop scheduling problem which should be processed by m machines. purpose ofscheduling open shop problem is attaining to a suitable order of processing jobs byspecified mach...

We introduce a new technique for solving several sequencing problems. We consider Gilmore and Gomory’s variant of the Traveling Salesman Problem and two variants of no-wait flowshop scheduling, the classical makespan minimization problem and a new problem arising in the multistage production process in steel manufacturing. Our technique is based on an intuitive interpretation of sequencing prob...

A great deal of work has been done to analyze the problem of robot move sequencing and part scheduling in robotic cell flowshops. We examine the recent developments in this literature. A robotic cell flowshop consists of a number of processing stages served by one or more robots. Each stage has one or more machines that perform that stage’s processing. Types of robotic cells are differentiated ...

Operating rooms (ORs) are simultaneously the largest cost center and greatest source of revenues for most hospitals. Due to significant uncertainty in surgery durations, scheduling of ORs can be very challenging. Longer than average surgery durations result in late starts not only for the next surgery in the schedule, but potentially for the rest of the surgeries in the day as well. Late starts...

This paper addresses a surgery sequencing and scheduling problem in multiple operating rooms (OR) constrained by shared downstream post-anesthesia care unit (PACU) capacity. We propose a two-stage solution method to minimize the expected value of a cost function that includes patient waiting time, surgeon idle time, OR blocking time, OR overtime and PACU overtime. In the first stage, we propose...

We consider a single-machine scheduling problem with a multi-level product structure. Setups are required if the machine changes production from one product type to another, and the scheduling decision must satisfy dynamic demand. We propose a lotsizing as well as a scheduling model, and we compare solution procedures for both models on a small set of instances. The multi-level structure compli...

tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. hence, integration has been proposed to decide about these problems concurrently. main problem in integration is how we can relate pro...

in this paper, a new approach to overlapping operations in job shop scheduling is presented. in many job shops, a customer demand can be met in more than one way for each job, where demand determines the quantity of each finished job ordered by a customer. in each job, embedded operations can be performed due to overlapping considerations in which each operation may be overlapped with the other...

this paper gives a new application of dea to evaluate the scheduling solutions of parallel processing. it evaluates the scheduling solutions of parallel processing using the non-convex dea model, fdh model. by introducing each solution of parallel processing scheduling as a dmu with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.