AbstractThis paper considers sequencing of n jobs on a single machine. The total-work-content-power (TWK-P) due-date assignment method is used to assign due-dates to jobs. The objective is to determine the optimal due-date multiple factor so as to minimize a cost function based on the due-date multiple and job earliness, and tardiness values. A linear programming (LP) formulation of the problem is proposed and the optimal solution is determined via considering the LP dual problem
AbstractWe study bicriteria problems of minimizing maximum tardiness and total due date assignment c...
AbstractThis paper introduces a new subclass of machine scheduling problems in which due dates are t...
AbstractThis paper considers the problem of optimal assignment of slack due-dates to n jobs and sequ...
AbstractThis paper considers sequencing of n jobs on a single machine. The total-work-content-power ...
AbstractThis paper considers due-date assignments and sequencing of n jobs in a single- machine shop...
AbstractThis paper considers the same problem as studied previously by Cheng which is concerned with...
AbstractThis paper considers the problem of optimal constant due-date assignment and sequencing of j...
AbstractThis paper considers the problem of due-date determination and sequencing of n stochasticall...
AbstractGiven a set of n jobs with deterministic processing times and the same ready times, the prob...
AbstractGiven a set of n jobs each of which is assigned a due-date and all jobs are simultaneously a...
AbstractThis paper considers the problem of optimal assignment of slack due-dates to n jobs and sequ...
Department of Logistics2008-2009 > Academic research: refereed > Publication in refereed journalAcce...
In this paper, we consider a single-machine earliness-tardiness scheduling problem with due-date ass...
This paper is concerned with the optimal due dates and the optimal sequence to a set of jobs on a si...
Abstract: In this paper we consider a total penalty for the n job, one machine scheduling problem in...
AbstractWe study bicriteria problems of minimizing maximum tardiness and total due date assignment c...
AbstractThis paper introduces a new subclass of machine scheduling problems in which due dates are t...
AbstractThis paper considers the problem of optimal assignment of slack due-dates to n jobs and sequ...
AbstractThis paper considers sequencing of n jobs on a single machine. The total-work-content-power ...
AbstractThis paper considers due-date assignments and sequencing of n jobs in a single- machine shop...
AbstractThis paper considers the same problem as studied previously by Cheng which is concerned with...
AbstractThis paper considers the problem of optimal constant due-date assignment and sequencing of j...
AbstractThis paper considers the problem of due-date determination and sequencing of n stochasticall...
AbstractGiven a set of n jobs with deterministic processing times and the same ready times, the prob...
AbstractGiven a set of n jobs each of which is assigned a due-date and all jobs are simultaneously a...
AbstractThis paper considers the problem of optimal assignment of slack due-dates to n jobs and sequ...
Department of Logistics2008-2009 > Academic research: refereed > Publication in refereed journalAcce...
In this paper, we consider a single-machine earliness-tardiness scheduling problem with due-date ass...
This paper is concerned with the optimal due dates and the optimal sequence to a set of jobs on a si...
Abstract: In this paper we consider a total penalty for the n job, one machine scheduling problem in...
AbstractWe study bicriteria problems of minimizing maximum tardiness and total due date assignment c...
AbstractThis paper introduces a new subclass of machine scheduling problems in which due dates are t...
AbstractThis paper considers the problem of optimal assignment of slack due-dates to n jobs and sequ...