ویراساینس.
سند علمی

Two-agent group scheduling with deteriorating jobs on a single machine

Peng Liu, Lixin Tang, Xiaoye Zhou

چکیده

This paper considers the two-agent scheduling problems with deteriorating jobs and group technology on a single machine, where the objective is to minimize the total completion time of the first agent with the restriction that the maximum cost of the second agent cannot exceed a given upper bound. Two agents compete to perform their respective jobs on a common single machine, and each agent has his own criterion to optimize. We introduce deteriorating jobs and group technology into the two-agent single-machine scheduling where the job processing times and group setup times are both functions of their starting times. There are two different linear deterioration functions. We propose the optimal properties and present the optimal polynomial time algorithms for two different scheduling problems, respectively.

اسناد مشابه

  • Single Machine Scheduling with Job-Dependent Machine Deterioration

    سند علمی۲۰۱۶ISAACWenchang Luo, Yao Xu, Weitian Tong, Guohui Lin

    We consider the single machine scheduling problem with job-dependent machine deterioration. In the problem, we are given a single machine with an initial non-negative maintenance level, and a set of jobs each with a non-preemptive processing time and a machine deterioration. Such

  • A Model for Scheduling Deteriorating Jobs with Rate-Modifying-Activities on a Single Machine

    سند علمی۲۰۰۹Yucel Ozturkoglu, Robert L. Bulfin, Emmett Lodree

    In this study we examine scheduling a set of deteriorating jobs on a single processor. We propose a model which reflects real life situations in which the processing time of jobs increases or decreases depending on its initial processing time and other activities such as maintena

  • Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs

    سند علمی۲۰۰۶Theor. Comput. Sci.T. C. Edwin Cheng, C. T. Ng, J. J. Yuan

    We consider the feasibility model of multi-agent scheduling on a single machine, where each agent’s objective function is to minimize the total weighted number of tardy jobs. We show that the problem is strongly NP-complete in general. When the number of agents is fixed, we first

  • Coupled-task scheduling on a single machine subject to a fixed-job-sequence

    سند علمی۲۰۱۱Computers & Industrial EngineeringFeng-Jang Hwang, Bertrand M. T. Lin

    This paper investigates single-machine coupled-task scheduling where each job has two tasks separated by an exact delay. The objective of this study is to schedule the tasks to minimize the makespan subject to a given job sequence. We introduce several intriguing properties of th

  • On-line scheduling on a single machine: maximizing the number of early jobs

    سند علمی۲۰۰۰Oper. Res. Lett.Han Hoogeveen, Chris N. Potts, Gerhard J. Woeginger

    This note deals with the scheduling problem of maximizing the number of early jobs on a single machine. We investigate the on-line version of this problem in the Preemption-Restart model. This means that jobs may be preempted, but preempting results in all the work done on this j

  • Scheduling on a Single Machine to Minimize Total Flow Time with Job Rejections

    سند علمی۲۰۰۵David P. Bunde

    We consider the problem of minimizing flow time on a single machine supporting preemption that can reject jobs at a cost. Even if all jobs have the same rejection cost, we show that no online algorithm can have competitive ratio better than (2+ √ 2)/2 ≈ 1.707 in general or e/(e−