In this paper, we consider two scheduling problems on a single machine, where a specific objective function has to be maximized in contrast to usual minimization problems. We propose exact algorithms for the single machine problem of maximizing total tardiness 1‖max-Σ T j and for the problem...
scheduling algorithmsscheduling techniquesscheduling support systemThere seems to be a significant gap between the theoretical and the practical aspects of scheduling problems in the job shop environment. Theoretically, scheduling systems are designed on the basis of an optimum approach to the scheduling ...
In this paper, for the offline problem of single machine scheduling with sequence-independent set-ups, we present the first known polynomial-time approximation algorithms for the total weighted completion time and the maximum lateness problems. For the total weighted completion time problem, our algori...
We prove lower bounds on the competitive ratio of randomized algorithms for several on-line scheduling problems. The main result is a bound of e/(e1) for the on-line problem with objective minimizing the sum of completion times of jobs that arrive over time at their release times and are ...
Using dual approximation algorithms for scheduling problems theoretical and practical results The problem of scheduling a set of n jobs on m identical machines so as to minimize the makespan time is perhaps the most well-studied problem in the theor... DS Hochbaum,DB Shmoys - Symposium on ...
In this paper we study a large set of single-machine scheduling problems with resource-dependent processing times that reduce (consolidate) to the same mathematical model. We take advantage of this property to present a set of universal (unified) heuristic algorithms capable of solving any of the...
THEVEHICLEROUTINGANDSCHEDULINGPROBLEMS WITHTIMEWINDOWCONSTRAINTS MARIUSM.SOLOMON NortheasternUniversity,Boston,Massachusetts (ReceivedFebruary1984;revisionsreceivedOctober1984;March,October1985;acceptedDecember1985) Thispaperconsidersthedesignandanalysisofalgorithmsforvehicleroutingandschedulingproblemswithtimewindow constraints...
In this paper we consider several constrained machine scheduling problems. The first model consists of n jobs and m identical machines that operate in parallel. Each job j has a processing time p j and must be processed without interruption for time p j on any one of the m machines. In ...
Morris (2002), Scheduling earth observing fleets using evolutionary algorithms: Problem description and approach. In Proc. of the 3rd Int'... A Globus,J Crawford,J Lohn,... - 《Proceedings of International Nasa Workshop on Planning & Scheduling for Space》 被引量: 203发表: 2002年 ...
(2009) built branch-and-bound algorithms for several NP-hard two-agent scheduling problems. Cheng et al. (2006) solved the feasibility model of multi-agent scheduling on a single machine where each agent׳s objective function is to minimize the total weighted number of tardy jobs. Cheng et...