Abstract Single-machine scheduling where jobs have a penalty for being late or rejected altogether is an important (sub)problem in manufacturing, logistics, and satellite scheduling. It known to be NP-hard the strong sense, there no polynomial-time algorithm that can guarantee constant-factor approximation (unless P=NP). We provide exact fixed-parameter tractable slack maximum number of time wi...

We consider an M/G/∞ model with exponentially distributed setup times. Arrivals result in an off server starting a setup. Upon completing a setup, a server begins serving a waiting customer. Upon completing service, with probability p the server becomes eligible to serve another waiting customer. Among other things, we show, in steady state, that the number of busy servers is Poisson distribute...

Setup operations play an important role in many production environments. In this paper, the exact modeling of setup times is motivated and two mixed integer programming model formulations are proposed. These model formulations allow the representation of ‘‘long’’ setup times with respect to the length of a planning period, which are widespread in process industries. Computational results unders...

We study a scheduling problem in which jobs may be split into parts, where the parts of a split job may be processed simultaneously on more than one machine. Each part of a job requires a setup time, however, on the machine where the job part is processed. During setup, a machine cannot process or set up any other job. We concentrate on the basic case in which setup times are job-, machineand s...

In this paper we consider microfactories for manipulation and assembly. These microfactories are composed of several cells containing microrobotic systems capable of a high level of repeatability. The assembly plan of the production is a pipeline of tasks that are performed by the cells. Our aim is to manage the production flow in the case where the cells can be reconfigured to perform differen...

The flowshop scheduling problem with sequence dependent setup times is considered and shown to be NP-complete. A traveling salesman problem formulation is proposed for the case where jobs are processed continuously through the shop. These results are used to describe an approximate algorithm for the case where limited or infinite intermediate storage space is available to hold partially complet...

The two-stage hybrid flow shop problem under setup times is addressed in this paper. This NP-Hard. on the other hand, studied modeling different real-life applications especially manufacturing and high performance-computing. Tackling kind of requires development adapted algorithms. In context, a metaheuristic using genetic algorithm three heuristics are proposed These approximate solutions opti...

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 ...

this paper presents a new mathematical model for a bi-objective job shop scheduling problem with sequence-dependent setup times that minimizes the weighted mean completion time and the weighted mean tardiness time. for solving this multi-objective model, we develop a fuzzy multi-objective linear programming (fmolp) model. in this problem, a proposed fmolp method is applied with respect to the o...