Results 11 to 20 of about 167,661,519 (247)
Scheduling Intermittently Arriving Jobs to Minimize the Weighted Number Tardy [PDF]
, 1975 The problem of scheduling n jobs on one machine to minimize the weighted number tardy is considered, when job arrival times, processing times, due dates and weights are given constants.
Dadachanji, Keki R.
core +4 more sources
Minimizing the number of tardy jobs in single machine sequencing [PDF]
, 1993 A set P of n jobs has to be processed without preemption, one job at a time, on a single machine. The weight and processing time of each job is one. Furthermore, the jobs are subject to precedence constraints represented by a given ordered set (P,⩽).
Ahmad H. Sharary +3 more
core +1 more source
A New Artificial Immune System Algorithm for Multiobjective Fuzzy Flow Shop Problems [PDF]
International Journal of Computational Intelligence Systems, 2009 In this paper a new artificial immune system (AIS) algorithm is proposed to solve multi objective fuzzy flow shop scheduling problems. A new mutation operator is also described for this AIS.
Cengiz Kahraman +2 more
doaj +1 more source
Minimizing the weighted number of tardy jobs on a single machine: Strongly correlated instances [PDF]
, 2022 This paper addresses a single machine scheduling problem minimizing the weighted number of tardy jobs, where each job is characterized by processing time, due date, deadline, and weight.
Novák A. +3 more
core +1 more source
Batch scheduling to minimize the weighted number of tardy jobs [PDF]
, 2007 In this paper, we address a single-machine scheduling problem with due dates and batch setup times to minimize the weighted number of tardy jobs. We give a pseudo-polynomial dynamic program and a fully-polynomial approximation scheme for the case where ...
Ghosh, J. B., Erel, E.
core +1 more source
Ant Colony Method to Minimize Single Machine Scheduling Problem
مجلة علوم ذي قار, 2019 The study deal with a single machine scheduling problem where the objective is to find the sequence which it give the optimal or efficient solution for the objective function the sum of discounted weighted completion time and number of tardy jobs.
Sami .M Araibi
doaj +4 more sources
, 2003 We consider the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs. Each job consists of several operations that belong to different families.
Cheng, TCE, Ng, CT, Yuan, JJ
core +2 more sources
Two-Agent Single Machine Order Acceptance Scheduling Problem to Maximize Net Revenue
Complexity, 2021 The paper considers two-agent order acceptance scheduling problems with different scheduling criteria. Two agents have a set of jobs to be processed by a single machine. The processing time and due date of each job are known in advance.
Jiaji Li +4 more
doaj +1 more source
Minimizing the expected weighted number of tardy jobs in stochastic flow shops [PDF]
, 1986 This paper is devoted to two types of stochastic scheduling problems, one involving a single machine and the other involving a flow shop consisting of an arbitrary number of machines.
Forst, F.G. +5 more
core +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