Journal ArticleDOI
Single machine scheduling with truncated job-dependent learning effect
Reads0
Chats0
TLDR
This paper considers the single machine scheduling problem with truncated job-dependent learning effect and several polynomial time algorithms are proposed to optimally solve the problems with the above objective functions.Abstract:
In this paper we consider the single machine scheduling problem with truncated job-dependent learning effect. By the truncated job-dependent learning effect, we mean that the actual job processing time is a function which depends not only on the job-dependent learning effect (i.e., the learning in the production process of some jobs to be faster than that of others) but also on a control parameter. The objectives are to minimize the makespan, the total completion time, the total absolute deviation of completion time, the earliness, tardiness and common (slack) due-date penalty, respectively. Several polynomial time algorithms are proposed to optimally solve the problems with the above objective functions.read more
Citations
More filters
Journal ArticleDOI
Operating room planning and surgical case scheduling: a review of literature
Shuwan Zhu,Shuwan Zhu,Fan Wenjuan,Fan Wenjuan,Shanlin Yang,Shanlin Yang,Jun Pei,Jun Pei,Jun Pei,Panos M. Pardalos +9 more
TL;DR: It is shown that mathematical programming and heuristics are frequently applied in the complex linear and combinatorial optimization problems.
Journal ArticleDOI
Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time
Jun Pei,Jun Pei,Jun Pei,Bayi Cheng,Bayi Cheng,Xinbao Liu,Xinbao Liu,Panos M. Pardalos,Min Kong,Min Kong +9 more
TL;DR: It is demonstrated that the consideration of different objectives leads to various optimal decisions on jobs assignment, jobs batching, and batches sequencing, which generates a new insight to investigate batching scheduling problems with learning effect under single-machine and parallel-machine settings.
Journal ArticleDOI
Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects
TL;DR: In this article, the authors consider single machine scheduling problems with controllable processing time (resource allocation), truncated job-dependent learning and deterioration effects, and find the optimal sequence of jobs and the optimal resource allocation separately for minimizing a cost function containing makespan (total completion time, total absolute differences in completion times) and total resource cost.
Journal ArticleDOI
Single-machine scheduling with learning effect and resource-dependent processing times in the serial-batching production
Jun Pei,Jun Pei,Xinbao Liu,Xinbao Liu,Baoyu Liao,Baoyu Liao,Panos M. Pardalos,Min Kong,Min Kong +8 more
TL;DR: A novel hybrid GSA–TS algorithm which combines the Gravitational Search Algorithm and the Tabu Search algorithm to solve the general case and proposes the structural properties for job batching policies and batching sequencing.
Journal ArticleDOI
Single-machine scheduling with truncated sum-of-processing-times-based learning effect including proportional delivery times
Yu-Bin Wu,Jian-Jun Wang +1 more
TL;DR: It is proved that the single-machine scheduling problem with truncated sum-of-processing-times-based learning effect and past-sequence-dependent job delivery times can be solved in polynomial time for some regular objective functions.
References
More filters
Book ChapterDOI
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
TL;DR: In this article, the authors survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory, and indicate some problems for future research and include a selective bibliography.
Journal ArticleDOI
Factors affecting the cost of airplanes
TL;DR: The matter became of increasing interest and importance because of the program sponsored by the Bureau of Air Commerce for the development of a small two-place airplane which, it was hoped, could be marketed at $700 assuming a quantity of ten thousand units could be released for construction.
Journal ArticleDOI
Single-machine scheduling with learning considerations
TL;DR: It is shown in this paper that even with the introduction of learning to job processing times two important types of single-machine problems remain polynomially solvable.
Journal ArticleDOI
A state-of-the-art review on scheduling with learning effects
TL;DR: The questions why and when learning effects in scheduling environments might occur and should be regarded from a planning perspective are discussed.
Journal ArticleDOI
Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
TL;DR: A polynomial bound scheduling algorithm is presented for the solution of this problem along with the proof of optimality, a numerical example and discuss some extensions.