Purpose: In this study, a mixed-integer programming model is developed to minimize the total lateness and completion time of jobs in an automotive company. order respond rapidly continuous customer demand through production, work schedule engineers research development department considered flexibly. Methodology: supported by analytical hierarchy process determine weighted values tardiness time...

Managers of multiple projects with overly constrained resources face difficult decisions in how to allocate resources to minimize the average delay per project or the time to complete the whole set of projects. We address the static resource-constrained multi-project scheduling problem (RCMPSP) with two lateness objectives, project lateness and portfolio lateness. In this context, past research...

Scheduling problems occur in a lot of application fields such as production, timetabling and computer systems. These problems have already been widely studied and modeled (Carlier and Chrétienne, 1988; Pinedo, 1995; Pinedo and Chao, 1999; Vernadat, 1999). Each problem has its own characteristics; it is much more complicated when tackling real industrial problems. Starting from object-oriented t...

This paper discusses a two-stage assembly-type flowshop scheduling problem with batching considerations subject to a fixed job sequence. The two-stage assembly flowshop consists of m stage-1 parallel dedicated machines and a stage-2 assembly machine which processes the jobs in batches. Four regular performance metrics, namely, the total completion time, maximum lateness, total tardiness, and nu...

We tackle the problem of non-preemptive scheduling of a set of tasks of duration p over m machines with given release and deadline times. We present a polynomial time algorithm as a generalization to this problem, when the number of machines fluctuates over time. Further, we consider different objective functions for this problem. We show that if an arbitrary function cost ci(t) is associated t...

We consider single-machine scheduling problems with past-sequence-dependent (p-s-d) job delivery times. The p-s-d delivery time is needed to remove any waiting time-induced adverse effects on the job’s condition (prior to delivering the job to the customer) and it is therefore proportional to the job’s waiting time. We show that single-machine scheduling problems with p-s-d delivery times and w...

This paper addresses a static, n-job, single-machine scheduling problem with sequence dependent family setups. The setup matrix follows a special structure where a constant setup is required only if a job from a smaller indexed family is an immediate successor of one from a larger indexed family. The objective is to minimize the maximum lateness (Lmax). A two-step neighborhood search procedure ...

Although scheduling with deteriorating jobs and learning effect has been widely investigated, scheduling research has seldom considered the two phenomena simultaneously. However, job deterioration and learning co-exist in many realistic scheduling situations. In this paper we introduce a new scheduling model in which both job deterioration and learning exist simultaneously. The actual processin...

We examine the performance of Shifting Bottleneck (SB) heuristics for shop scheduling problems where the performance measure to be minimized is makespan (Cmax) or maximum lateness (Lmax). Extensive computational experiments are conducted on benchmark problems from the literature as well as several thousand randomly generated test problems with three different routing structures and up to 1000 o...