The single machine coupled task scheduling problem includes a set of jobs, each with two separated tasks, and there is an exact delay between the tasks. We investigate objective minimizing makespan under identical processing time for first period all time-dependent setting second task. Certain healthcare appointment problems can be modeled as problem. Also, incorporation lets human resource fat...

Abstract In this paper, an identical parallel machine scheduling problem with step-deteriorating jobs is considered to minimize the weighted sum of tardiness cost and extra energy consumption cost. particular, actual processing time a job assumed be step function its starting deteriorating threshold. When later than threshold, faces two choices: (1) maintaining status in holding equipment being...

We study a problem of scheduling a maintenance activity on a single machine. Following several recent papers, the maintenance is assumed to be deteriorating, that is, delaying the maintenance increases the time required to perform it. The following objective functions are considered: makespan, flowtime, maximum lateness, total earliness, tardiness and due-date cost, and number of tardy jobs. We...

The paper deals with a problem of scheduling deteriorating jobs on a single machine to minimize the total completion time. Deterioration of a job means that its processing time is a function of its execution start time. We present some optimal properties for three problems, which correspond to three different decreasing linear functions, whose increasing counterparts have been studied in the li...

We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. The objective is to minimize the makespan. We first show that the problem can be solved optimally by 0–1 integer progra...

This study investigates the single-machine scheduling problem with common due-win -dow assignment, past-sequence-dependent (p-s-d) setup times and a deteriorating maintenance activity. By past-sequence-dependent setup times, we mean that the setup time of a job is proportional to the sum of the processing times of the jobs already processed. The objective is to minimize a cost function based on...

This paper studies a single-machine problem with resource allocation (RA) and deteriorating effect (DE). Under group technology (GT) limited availability, our goal is to determine the schedules of groups jobs within each such that total completion time minimized. For three special cases, polynomial algorithms are given. general case, heuristic, tabu search algorithm, an exact (i.e., branch-and-...

In this paper, we study a scheduling problem of minimizing the total completion time on a single machine where the processing time of a job is a step function of its starting time and a due date that is common to all jobs. This problem has been shown to be NP-hard in the literature. To derive optimal solutions from a practical aspect, we develop a lower bound and two elimination rules to design...