Results 11 to 20 of about 6,981,143 (177)
Dynamic resource constrained multi-project scheduling problem with weighted earliness/tardiness costs [PDF]
, 2012 In this study, a conceptual framework is given for the dynamic multi-project scheduling problem with weighted earliness/tardiness costs (DRCMPSPWET) and a mathematical programming formulation of the problem is provided.
Ulusoy, Gündüz +2 more
core +2 more sources
Minimizing the Sum of Makespan and Total Weighted Tardiness in a No-Wait Flowshop
IEEE Access, 2018 This paper presents a cloud theory-based iterated greedy (CTIG) algorithm for solving the no-wait flowshop scheduling problem (NWFSP) with the objective of minimizing the sum of makespan and total weighted tardiness.
Shih-Wei Lin +2 more
doaj +1 more source
A Novel Hybrid Algorithm for Minimizing Total Weighted Tardiness Cost [PDF]
Computer Science Journal of Moldova, 2019 In this research paper, we aim to present a hybrid algorithm in order to obtain a better solution to the single machine total weighted tardiness scheduling problem (SMTWT).
Lamiche Chaabane
doaj
A Novel Ant Colony Algorithm for the Single-Machine Total Weighted Tardiness Problem with Sequence Dependent Setup Times [PDF]
International Journal of Computational Intelligence Systems, 2011 This paper deals with the NP-hard single-machine total weighted tardiness problem with sequence dependent setup times. Incorporating fuzzy sets and genetic operators, a novel ant colony optimization algorithm is developed for the problem. In the proposed
Fardin Ahmadizar, Leila Hosseini
doaj +1 more source
Study on Scheduling Problems with Learning Effects and Past Sequence Delivery Times
Mathematics, 2023 In this paper, we study a single-machine green scheduling problem with learning effects and past-sequence-dependent delivery times. The problem can be properly applied to tackle green manufacturing where production and delivery time are variable and ...
Hongyu He +5 more
doaj +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
Hybrid Scheduling Model for Independent Grid Tasks
The Scientific World Journal, 2015 Grid computing facilitates the resource sharing through the administrative domains which are geographically distributed. Scheduling in a distributed heterogeneous environment is intrinsically very hard because of the heterogeneous nature of resource ...
J. Shanthini +2 more
doaj +1 more source
Two-agent scheduling with generalized due dates
Asian Journal of Shipping and Logistics, 2018 In this paper we consider the problems of order pickers in warehouse management. We interpret the problems as machine scheduling problems in which the due dates are not specified for the jobs but for their positions.
Myoung-Ju Park +2 more
doaj +1 more source
KPI Science News, 2021 Background. In setting a problem of minimizing total weighted 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 ...
Vadim V. Romanuke
doaj +1 more source
Optimization for Due-Window Assignment Scheduling with Position-Dependent Weights
Discrete Dynamics in Nature and Society, 2020 This paper considers a single-machine due-window assignment scheduling problem with position-dependent weights, where the weights only depend on their position in a sequence. The objective is to minimise the total weighted penalty of earliness, tardiness,
Li-Yan Wang +4 more
doaj +1 more source