in this paper, three-stage assembly flowshop scheduling is considered with respect to minimizing bi-objectives, namely mean flow time and mean tardiness. this problem is a model of production systems, which several production operations are done simultaneously and independently, and then produced components are collected and transferred to an assembly stage for the final operation. in this mode...

We consider the problem of scheduling multiple families of jobs on identical parallel machines to minimize the total weighted completion time of the jobs. In this problem, a setup time is necessary whenever a job from one family is processed immediately after another job from a di erent family. The setup time could be sequence independent or sequence dependent. We propose a column generation ba...

In this paper we consider the single-machine setup times scheduling with general effects of deterioration and learning. By the general effects of deterioration and learning, we mean that the actual job processing time is a general function of the processing times of the jobs already processed and its scheduled position. The setup times are proportional to the length of the already processed job...

Stochastic dynamic job shop scheduling problem with consideration of sequence-dependent setup times are among the most difficult classes of scheduling problems. This paper assesses the performance of nine dispatching rules in such shop from makespan, mean flow time, maximum flow time, mean tardiness, maximum tardiness, number of tardy jobs, total setups and mean setup time performance measures ...

We propose a mesoscopic setup which exhibits strong and manifestly non-Gaussian fluctuations of energy and temperature when suitably driven out of equilibrium. The setup consists of a normal metal island (N) coupled by tunnel junctions (I) to two superconducting leads (S), forming a SINIS structure, and is biased near the threshold voltage for quasiparticle tunneling, eV≈2Δ. The fluctuations ca...

0360-8352/$ see front matter 2008 Elsevier Ltd. A doi:10.1016/j.cie.2008.09.004 q This manuscript was processed by Area Editor Ma * Corresponding author. Tel./fax: +52 653 5356168 E-mail address: [email protected] (V. Yaurima This paper presents a genetic algorithm for an important production scheduling problem. Since the problem is NP-hard, we focus on suboptimal scheduling solutions for the ...

This chapter presents a novel, mixed-integer programming model of the flexible flow line problem that minimizes the makespan of a product. The proposed model considers two main constraints, namely blocking processors and sequence-dependent setup time between jobs. We extend two previous studies conducted by Kurz and Askin (2004) and Sawik (2001), which considered only one of the foregoing const...

The work presented in this article generalizes the modeling of task scheduling problems with sequence dependent setup time on the basis of task scheduling on single respectively exclusive resources: Besides working activities also work breaks are respected properly which is formally proven. The additional contribution of this article is an effective pruning algorithm according to the presented ...

We show that a category of one-dimensional XY-type models may enable high-fidelity quantum state transmissions, regardless of details of coupling configurations. This observation leads to a fault-tolerant design of a state transmission setup. The setup is fault-tolerant, with specified thresholds, against engineering failures of coupling configurations, fabrication imperfections or defects, and...

The General Assembly Line Balancing Problem with Setups (GALBPS) was recently defined in the literature. It adds sequence-dependent setup time considerations to the classical Simple Assembly Line Balancing Problem (SALBP) as follows: whenever a task is assigned next to another at the same workstation, a setup time must be added to compute the global workstation time, thereby providing the task ...