Results 111 to 120 of about 6,554,898 (191)
New Ideas in Lagrangian Relaxation for a Scheduling Problem with the weighted Tardiness Criterion
International Journal of Applied Mathematics and Computer ScienceWe consider an extension of Lagrangian relaxation methods for solving the total weighted tardiness scheduling problem on a single machine. First, we investigate a straightforward relaxation method and decompose it into upper and lower subproblems.
Rudy Jarosław +4 more
doaj +1 more source
Total tardiness problem with future job arrival information
, 2006 We consider a single machine total tardiness problem with different release times, different due dates and available information of future job arrival in the next time period W. The goal is to generate an effective schedule for minimizing total tardiness
Huang, Fengjie
core
Order acceptance and scheduling in a single-machine environment: exact and heuristic algorithms. [PDF]
In this paper, we develop exact and heuristic algorithms for the order acceptance and scheduling problem in a single-machine environment. We consider the case where a pool consisting of firm planned orders as well as potential orders is available from ...
Herbots, Jada +2 more
core
Heuristic procedures for reactive project scheduling. [PDF]
This paper describes new heuristic reactive project scheduling procedures that may be used to repair resource-constrained roject baseline schedules that suer from multiple activity duration disruptions during project execution.The objective is to ...
Van de Vonder, S +3 more
core
MathematicsPermutation flow shop scheduling is an important production planning problem handled in different contexts. Just-in-time measures have been significant in the optimization of real problems and one is specifically addressed here: the total earliness and ...
Nícolas Samuel Assis +2 more
doaj +1 more source
A framework to minimise total energy consumption and total tardiness on a single machine
, 2008 This is the author's version of the work. It is posted here by permission of Taylor & Francis for personal use, not for redistribution. The definitive version was published in the International Journal of Sustainable Engineering, Vol. 1, No. 2, June 2008.
Mouzon, Gilles C. +1 more
core +1 more source
, 2019 We study a single machine scheduling problem with sequence-dependent setup time to minimize total tardiness. The jobs are grouped by family. Processing jobs in the same family does not need set up; otherwise there is a fixed amount of setup time between ...
Jang, Jaejin, Abdallah, Khaled S
core +1 more source
Minimizing Total Earliness and Total Tardiness on Single Machine with Release Dates
, 2011 This paper considers the bicriteria scheduling problem of minimizing the total earliness and the total tardiness on a single machine with release dates. In view of the fact that the problem has been characterized as NP-Hard, we propose two approximation ...
Elkanah Oyetunji, Ayodeji E. Oluleye
core +1 more source
Polynomially solvable total tardiness problems: Review and extensions
This paper shows that all polynomially solvable cases of the single machine total tardiness problem center around or are direct extensions of three well known results for that problem. A new polynomially solvable case for the problem is developed as well.
Koulamas, C.
core
Order batching in warehouses by minimizing total tardiness: a hybrid approach of weighted association rule mining and genetic algorithms. [PDF]
ScientificWorldJournal, 2013 Azadnia AH +4 more
europepmc +1 more source