Results 11 to 20 of about 7,608,228 (197)
A (2 + ε)-approximation algorithm for preemptive weighted flow time on a single machine [PDF]
Symposium on the Theory of Computing, 2020 Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions.
Lars Rohwedder, Andreas Wiese
semanticscholar +1 more source
KPI Science News, 2020 Background. In setting a problem of minimizing total tardiness by the heuristic based on remaining available and processing periods, there are two opposite ways to input the data: the job release dates are given in either ascending or descending order ...
Vadim V. Romanuke
doaj +1 more source
A PTAS for Minimizing Weighted Flow Time on a Single Machine [PDF]
Symposium on the Theory of Computing, 2022 An important objective function in the scheduling literature is to minimize the sum of weighted flow times. We are given a set of jobs, where each job is characterized by a release time, a processing time, and a weight.
A. Armbruster +2 more
semanticscholar +1 more source
Minimizing the sum of flow times with batching and delivery in a supply chain [PDF]
, 2005 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.The aim of this thesis is to study one of the classical scheduling objectives that is of minimizing the sum of flow times, in the context of a supply chain ...
Mazdeh, Mohammad Mahdavi +1 more
core +7 more sources
Fifty years of scheduling: a survey of milestones [PDF]
, 2009 Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid 1950s when the landmark publications started to appear.
Strusevich, Vitaly A. +5 more
core +1 more source
Preemptive scheduling of parallel jobs of two sizes with controllable processing times
Journal of Scheduling, 2023 In parallel machine scheduling, a size of a job is defined as the number of machines that are simultaneously required for its processing. This paper considers a scheduling problem in which the set of jobs consists of jobs of two sizes: the conventional ...
A. Shioura +2 more
semanticscholar +1 more source
Split-merge:using exponential neighborhood search for scheduling a batching machine [PDF]
, 2015 We address the problem of scheduling a single batching machine to minimize the maximum lateness with a constraint restricting the batch size. A solution for this NP-hard problem is defined by a selection of jobs for each batch and an ordering of those ...
Song, Xiang +3 more
core +1 more source
A linear programming-based method for job shop scheduling [PDF]
, 2012 We present a decomposition heuristic for a large class of job shop scheduling problems. This heuristic utilizes information from the linear programming formulation of the associated optimal timing problem to solve subproblems, can be used for any ...
Bülbül, Kerem, Kaminsky, Philip
core +1 more source
European Journal of Operational Research, 2020 In this paper we consider the single-machine hierarchical scheduling problems with release dates and preemption, where the primary criterion is the total completion time and the secondary criterion is an arbitrarily regular scheduling criterion, which is
Rubing Chen +3 more
semanticscholar +1 more source