Purpose: The purpose of this paper to develop an inventory model for instantaneous deteriorating items with the consideration of the facts that the deterioration rate can be controlled by using the preservation technology (PT) and the holding cost & demand rate both are linear function of time which was treated as constant in most of the deteriorating inventory model. Design/methodology/approac...

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

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

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

A moldable job is a job that can be executed on an arbitrary number of processors, and whose processing time depends on the number of processors allotted to it. A moldable job is monotone if its work doesn’t decrease for an increasing number of allotted processors. We consider the problem of scheduling monotone moldable jobs to minimize the makespan. We argue that for certain compact input enco...

We consider a scheduling problem where a set of jobs is apriori distributed over parallel machines. The processing time of any job is dependent on the usage of a scarce renewable resource, e.g. personnel. An amount of k units of that resource can be allocated to the jobs at any time, and the more of that resource is allocated to a job, the smaller its processing time. The dependence of processi...

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