Single machine common flow allowance scheduling with deteriorating jobs and a rate-modifying activity
نویسندگان
چکیده
منابع مشابه
Single Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملA Model for Scheduling Deteriorating Jobs with Rate-Modifying-Activities on a Single Machine
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 maintenance or repair of machine, break for workers, etc. Since we assume workers as processors in our study, a rate modifyin...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs and a mathematical model based on binary integer programming (BIP) is developed. Since the precedence constraints exist, a job cannot start before completion of its all predecessors. The proposed model consists of two steps: in the first step, the earliest starting time of each job is c...
متن کاملNote on "Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity"
Article history: Received 19 November 2012 Received in revised form 8 May 2013 Accepted 22 August 2013 Available online 31 August 2013
متن کاملGENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS
This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2014
ISSN: 0307-904X
DOI: 10.1016/j.apm.2014.04.037