Topic
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.
Papers published on a yearly basis
Papers
More filters
TL;DR: This paper presents an exact branch-and-bound method to solve the single machine scheduling problem under a weighted completion time performance metric, and shows that the algorithm is able to optimally solve instances of moderate size.
37 citations
TL;DR: In this paper, the results of simulation tests for multi-item, single-machine production systems facing stochastic, time-varying demands are discussed, and six different heuristics are compared with the objective of minimizing the sum of changeover and inventory costs.
Abstract: This paper discusses the results of simulation tests for multi-item, single-machine production systems facing stochastic, time-varying demands. Six different heuristics are compared with the objective of minimizing the sum of changeover and inventory costs. Tests are performed to evaluate the effect of the stationarity of the demand process and of the level of forecast errors on the performance of the heuristics tested.
37 citations
TL;DR: A branch and bound algorithm is presented and the same algorithm is extended to generate epsilon optimal solutions for large sized problems (i.e., number of jobs > 30) and results of simulated annealing are compared.
37 citations
TL;DR: It is proved that even when the machine works at a variable rate, the pair-wise interchange of jobs minimizes the maximum tardiness and a simple modification to the well-known Moore-Hodgson's algorithm yields the minimum number of tardy jobs.
37 citations
01 Jun 2010
TL;DR: Computational results show that the proposed FMOLP model achieves lower objective functions and higher satisfaction degrees.
Abstract: This paper develops a fuzzy multi-objective linear programming (FMOLP) model for solving a multi-objective single-machine scheduling problem. The proposed model attempts to minimize the total weighted tardiness and makespan simultaneously. In this problem, a proposed FMOLP method is applied with respect to the overall acceptable degree of the decision maker (DM) satisfaction. A number of numerical examples are solved to show the effectiveness of the proposed approach. The related results are compared with the Wang and Liang's approach. These computational results show that the proposed FMOLP model achieves lower objective functions and higher satisfaction degrees.
37 citations