Single-machine scheduling

About: Single-machine scheduling is a research topic. Over the lifetime, 2473 publications have been published within this topic receiving 56288 citations.

Single machine scheduling with slack due dates assignment

Abstract: This paper considers a single machine scheduling problem in which each job is assigned an individual due date based on a common flow allowance (i.e. all jobs have slack due date). The goal is to find a sequence for jobs, together with a due date assignment, that minimizes a non-regular criterion comprising the total weighted absolute lateness value and common flow allowance cost, where the weight is a position-dependent weight. In order to solve this problem, an time algorithm is proposed. Some extensions of the problem are also shown.

Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration

Abstract: This article studies a single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity. We assume that after maintenance activity, the machine will revert to its initial condition and the aging effects will start anew. Moreover, due to the restriction of budget of maintenance, the limitation of the maintenance frequency on the machine is assumed to be known in advance. The optional maintenance activity of this study means that the starting time of the maintenance activity is unknown in advance. It can be scheduled immediately after the processing of any job that has been completed. Therefore, the planner must to make decision on whether or when to schedule the maintenance activity during the scheduling horizon to optimal the performance measures. The objective is to minimize the makespan. We first show that the addressed problem is NP-hard in the strong sense. Then a fully polynomial-time approximation scheme (FPTAS) for the proposed problem is presented.

Single machine scheduling with multiple objectives in semiconductor manufacturing

Abstract: To deal with today’s stiff competition in the logistics of semiconductor manufacturing, the development of an efficient scheduling approach for the complex semiconductor back-end testing operations is very essential, where more than one objective, such as cycle time, machine utilization and due date accuracy are kept in the focus to various degrees simultaneously. In this paper, the problem of scheduling N independent jobs on a single testing machine with due dates and sequence-dependent setup times is addressed, where the multiple objectives are to minimize average cycle time and average tardiness and to maximize machine utilization. A near optimal solution, which is not inferior to any other feasible solution in terms of all objectives, is generated combining the analytically optimal and conjunctive simulated scheduling approach. First, the machine-scheduling problem is modeled using the discrete event simulation approach and the problem is divided into simulation clock-based lot selection sub-problems. Then, at each decision instance in simulated time, a Pareto optimal lot is selected using the compromise programming technique for multi-objective optimization. With the help of a broad experimental design, this developed solution is then compared with common heuristic-dispatching rules used in industry such as the shortest processing time (SPT) and earliest due date (EDD). The developed scheduling method shows better results for all the objectives over a wide range of problems. It shows approximately 16.7% reduction in average cycle time, 25.6% reduction in average tardiness, and 21.6% improvement in machine utilization over the common dispatching rules, SPT and EDD.

New Results On Sequencing With Rate Modification

Abstract: In many production systems a time period is scheduled for machine maintenance, during which the machine is idle. After the maintenance activity is completed the production rate may be affected. The decisions under consideration are (i) when to schedule this rate-modifying activity, and (ii) how to sequence the jobs. We study three single machine scheduling problems with a rate-modifying activity: minimum makespan with precedence constraints, minimum makespan with a learning effect and minimum number of tardy jobs. We introduce a polynomial time solution for each of the three problems.