|
A two-agent scheduling problem in a two-machine flowshop
|
# |
|
|
Exact and heuristic algorithms for minimizing Tardy/Lost penalties on a single machine scheduling problem
|
# |
|
|
Minimizing the Number of Tardy Jobs in Single Machine Scheduling Problem under Bimodal Flexible Periodic Availability Constraints
|
# |
|
|
A Benders decomposition approach for order acceptance and scheduling problem a robust optimization approach
|
10.1007/s40314-015-0302-8 |
|
|
Minimizing a General Penalty Function on a Single Machine via Developing Approximation Algorithms and FPTASs
|
# |
|
|
Minimizing maximum earliness in single-machine scheduling with flexible maintenance time
|
# |
|
|
Maximizing the profit in customer s order acceptance and scheduling problem with weighted tardiness penalty
|
# |
|
|
Two-machine flow shop scheduling problem with blocking multi-task flexibility of the first machine and preemption
|
10.1016/j.cor.2016.09.023 |
|
|
A Lagrangian relaxation algorithm for order acceptance and scheduling problem a globalized robust optimization approach
|
# |
|
|
An approximation algorithm and FPTAS for Tardy/Lost minimization with common due dates on a single machine
|
# |
|
|
Robust scheduling of parallel machines considering total flow time
|
10.1016/j.cie.2015.12.024 |
|
|
Minimizing the Total Completion Time in a Single Machine Scheduling Problem under Bimodal Flexible Periodic Availability
|
# |
|
|
Two-agent order acceptance and scheduling to maximize total revenue
|
# |
|
|
A hybrid genetic and linear programming algorithm for two-agentorder acceptance and scheduling problem
|
# |
|
|
A novel metaheuristic algorithm and utility function for QoS based scheduling in user-centric grid systems
|
# |
|
|
Integrating Two-agent Scheduling and Order Acceptance to Maximize Total Revenue and Bounding Each Agent Penalty Function
|
# |
|
|
A hybrid variable neighborhood search algorithm for limited-buffer permutation flow shop scheduling problem with makespan criterion
|
# |
|
|
Minimizing the Number of Tardy Jobs on a Single Machine with an Availability Constraint
|
# |
|