✦ LIBER ✦

Single-machine group scheduling with both learning effects and deteriorating jobs

✍ Scribed by Xue Huang; Ming-Zheng Wang; Ji-Bo Wang

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 205 KB
Volume: 60
Category: Article
ISSN: 0360-8352
DOI: 10.1016/j.cie.2011.01.009

No coin nor oath required. For personal study only.

✦ Synopsis

In the paper two resource constrained single-machine group scheduling problems with both learning effects and deteriorating jobs are considered. By learning effects, deteriorating jobs and group technology assumption, we mean that the processing time of a job is defined by the function of its starting time and position in the group, and the group setup times of a group is a positive strictly decreasing continuous function of the amount of consumed resource. We present polynomial solutions for the makespan minimization problem under the constraint that the total resource consumption does not exceed a given limit, and the total resource consumption minimization problem under the constraint that the makespan does not exceed a given limit, respectively.

📜 SIMILAR VOLUMES

Single-machine scheduling problems with

Single-machine scheduling problems with both deteriorating jobs and learning effects

✍ Ji-Bo Wang; Dan Wang; Guo-Dong Zhang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 199 KB

Considerations of single-machine schedul

Considerations of single-machine scheduling with deteriorating jobs

✍ Chuan-Li Zhao; Chou-Jung Hsu; Dar-Li Yang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 220 KB

Single-machine scheduling jobs with expo

Single-machine scheduling jobs with exponential learning functions

✍ Ji-Bo Wang; Jian-Jun Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 195 KB

In a manufacturing system workers are involved in doing the same job or activity repeatedly. Hence, the workers start learning more about the job or activity. Because of the learning, the time to complete the job or activity starts decreasing, which is known as ''learning effect''. In this paper, an

Single machine scheduling with past-sequ

Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs

✍ Chuanli Zhao; Hengyong Tang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 180 KB

This paper considers single machine scheduling problems with setup times and deteriorating jobs. The setup times are proportional to the length of the already processed jobs, that is, the setup times are past-sequence-dependent (p-s-d). It is assumed that the job processing times are defined by func

Single-machine scheduling with deteriora

Single-machine scheduling with deteriorating functions for job processing times

✍ T.C.E. Cheng; Wen-Chiung Lee; Chin-Chia Wu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 194 KB

Single-machine group scheduling with res

Single-machine group scheduling with resource allocation and learning effect

✍ Zhanguo Zhu; Linyan Sun; Feng Chu; Ming Liu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 299 KB

This paper addresses single-machine scheduling problems under the consideration of learning effect and resource allocation in a group technology environment. In the proposed model of this paper the actual processing times of jobs depend on the job position, the group position, and the amount of reso