|
A note on Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
|
# |
|
|
Optimizing blocking flow shop scheduling problem with total completion time criterion
|
# |
|
|
Study of Payment Scheduling Problem to Achieve Client - Contractor Agreement
|
# |
|
|
Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness
|
# |
|
|
An optimal method for the preemptive job shop scheduling problem
|
# |
|
|
An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
|
# |
|
|
A branch-and-bound algorithm for the single machine scheduling with quadratic earliness and tardiness penalties
|
# |
|
|
Mathematical models for preemptive shop scheduling problems
|
# |
|
|
Finding Pareto-optima for maximum tardiness maximum earliness and number of tardy jobs
|
# |
|
|
Minimizing Maximum Earliness and Number of Tardy Jobs in the Single Machine Scheduling Problem with Availability Constraint
|
# |
|
|
Minimizing the sum of maximum earliness and maximum tardiness in single -machine scheduling problem with sequenced-dependent setup time
|
# |
|
|
Minimizing the Number of Tardy Jobs and Maximum Earliness in the Single Machine Scheduling Using an Artificial Immune System
|
# |
|
|
Scheduling linear deteriorating jobs to minimize the number of tardy jobs
|
# |
|
|
A Pareto Approach to Multi-objective Flexible Job-Shop Scheduling Problem Using Particle Swarm Optimization and Local Search
|
# |
|
|
Minimizing Maximum Earliness and Number of Tardy Jobs in the Single Machine Scheduling Problem
|
# |
|
|
Minimizing The Number Of Tardy Jobs Under Piecewise-linear Deterioration
|
# |
|
|
Technology Incubators in Iran Policies Experiences and Outcomes
|
# |
|
|
Two machine flow shop scheduling to minimize the sum of maximum earliness and tardiness
|
# |
|
|
A branch and bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release times
|
# |
|
|
A branch and bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine
|
# |
|