[PDF] Top 20 Single machine scheduling to minimize the maximum tardiness under piecewise linear deteriorating jobs
Has 10000 "Single machine scheduling to minimize the maximum tardiness under piecewise linear deteriorating jobs" found on our website. Below are the top 20 most common "Single machine scheduling to minimize the maximum tardiness under piecewise linear deteriorating jobs".
Single machine scheduling to minimize the maximum tardiness under piecewise linear deteriorating jobs
... under piecewise linear deteriorating jobs was investi- gated whose objective is to minimize the maximum ...of jobs is an increasing function of their starting time ... See full document
16
A new mathematical model for single machine batch scheduling problem for minimizing maximum lateness with deteriorating jobs Pages 253-264 Download PDF
... deterioration scheduling problem in which the processing time of a job was a function of its starting ...simple linear deteriorating for single machine scheduling problem ... See full document
12
Single Machine Scheduling Problems with Delivery Times under Simple Linear Deterioration
... Scheduling deteriorating jobs was first considered by Browne and Yechiali [1] who assumed that the processing times of jobs are non-decreasing, start time dependent linear ...to ... See full document
5
A genetic algorithm for preemptive scheduling of a single machine Pages 607-614 Download PDF
... in scheduling, with earliness and tardiness penalties where the earliness costs was dependent on the start times of the ...the jobs had distinct due dates, earliness costs, and tardiness ...of ... See full document
8
Scheduling with Proportional Linear Deteriorating and a Maintenance Activity
... consider single machine scheduling with proportional linear deteriorating in which the processing time of a job depends on its starting time in a ...activity, machine will revert ... See full document
5
Single Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
... to minimize the total completion time and studied several deterioration ...parallel machine scheduling problem in which the processing time of each job was a simple linear function of its ... See full document
7
Solving Single Machine Scheduling Problem Using Type-2 Trapezoidal Fuzzy Numbers
... a single machine scheduling problem minimizing the maximum lateness of jobs with fuzzy precedence ...a single machine scheduling problem with fuzzy due ...a ... See full document
9
(T max ). The problems with those objective functions are proven
... parallel machine scheduling and try to minimize makespan and maximum tardiness ...a single objective function can be constructed, a linear combination of the various ... See full document
5
Mathematical models for a batch scheduling problem to minimize earliness and tardiness
... batch scheduling problem with the assumptions of a common due window and identical jobs to minimize the total weighted earliness and ...assign jobs into batches for the scheduling ... See full document
16
SINGLE MACHINE SLACK DUE-WINDOW SCHEDULING WITH LINEAR RESOURCE ALLOCATION, AGING EFFECT, AND A DETERIORATING RATE-MODIFYING ACTIVITY
... for jobs with changeable job processing times has been developed steadily in the last ...The single machine common due-window assignment problem with deteriorating jobs and learning ... See full document
12
A branch and bound for single machine stochastic scheduling to minimize the maximum lateness Pages 499-510 Download PDF
... processing jobs is required for all ...of tardiness and lateness in deterministic scheme in which the values of all the parameters of the problem (including processing time, due date, ...However, ... See full document
12
An improved memetic algorithm to minimize earliness–tardiness on a single batch processing machine
... processing machine scheduling problems due to its industrial ...reviewed.A single batch processing machine with non-identical job sizes was considered by Uzsoy ...to minimize the ... See full document
16
A two-agent scheduling problem in a two-machine flowshop Pages 289-306 Download PDF
... 20 jobs in size in a reasonable amount of ...two-agent scheduling in a two-machine ...on linear programming relaxation of the ...two-agent scheduling problem in a two machine ... See full document
18
Single Machine Slack Due Window Assignment and Scheduling of Linear Time Dependent Deteriorating Jobs and a Deteriorating Maintenance Activity
... the scheduling problem with a rate- modifying activity and time-dependent deteriorating jobs, and Cheng et ...teriorating jobs. [11] and [12] studied the problem to minimize the total ... See full document
9
Minimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop
... the scheduling problem on a single machine with linear deteriorating jobs to minimize the number of tardy jobs is NP-hard; hence, a B&B procedure and a ... See full document
10
Multi-criteria sequence-dependent single machine scheduling using genetic and simulated annealing algorithms
... the single machine scheduling problem with setup ...with linear programming relaxation ...Apparent Tardiness Cost with Setups (ATCS) [15] have also been proposed for solving this ...the ... See full document
6
A New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm
... from single to ...shop scheduling problem with fuzzy processing times and fuzzy due ...to minimize the maximum fuzzy completion ...shop scheduling problem with some dispatching ...to ... See full document
12
A Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
... of jobs and two levels for the number of machines, twelve different size groups are ...different tardiness factor, due date range, and setup times ...the jobs satisfying the condition before starting ... See full document
18
Ant Colony Approach for Makespan Minimization on Unrelated Parallel Machines
... parallel machine non-common due date scheduling problem, for jobs with varying processing times, where the objective is to minimize the completion time of ...parallel machine ... See full document
8
Specially structured n × 2 flow shop scheduling problem with jobs in a string of disjoint job blocks including transportation time
... to minimize the rental cost of machines under pre-defined rental policy in which the probabilities have been associated with processing ...of scheduling models depends various factors such as job ... See full document
6
Related subjects