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 work considers flow shop scheduling problems with a learning effect by using the optimal permutations for the corresponding single machine scheduling problems by minimizing one of the three regular performance criteria.
40 citations
TL;DR: In the case of unit execution times and integer lengths of delays, the problem is NP-hard in the strong sense, and an O(n2) optimal algorithm is provided.
40 citations
01 Mar 2017
TL;DR: Two hybrid metaheuristic approaches, viz. a hybrid steady-state genetic algorithm (SSGA) and a hybrid evolutionary algorithm with guided mutation (EA/G) for order acceptance and scheduling (OAS) problem in a single machine environment where orders are supposed to have release dates and sequence dependent setup times are incurred in switching from one order to next in the schedule.
Abstract: Graphical abstractDisplay Omitted HighlightsTwo evolutionary approaches are proposed for order acceptance and scheduling problem.First approach is based on steady-state genetic algorithm.Second approach is based on evolutionary algorithm with guided mutation.Our approaches are compared with two state-of-the-art approaches.Computational results show the effectiveness of our approaches. This paper presents two hybrid metaheuristic approaches, viz. a hybrid steady-state genetic algorithm (SSGA) and a hybrid evolutionary algorithm with guided mutation (EA/G) for order acceptance and scheduling (OAS) problem in a single machine environment where orders are supposed to have release dates and sequence dependent setup times are incurred in switching from one order to next in the schedule. OAS problem is an NP-hard problem. We have compared our approaches with the state-of-the-art approaches reported in the literature. Computational results show the effectiveness of our approaches.
39 citations
TL;DR: A deterministic approximation algorithm with performance ratio of O(lnK) for the min-max version of the problem is proposed and it is shown that both min- Max and min- max regret problems are not approximable within any constant factor unless P=NP, which strengthens the results known up to date.
39 citations
TL;DR: This paper addresses a two-agent scheduling problem on a single machine with arbitrary release dates, where the objective is to minimize the tardiness of one agent, while keeping the lateness of the other agent below or at a fixed level Q.
39 citations