Optimal due date assignment and resource allocation in a group technology scheduling environment

2010 ◽  
Vol 37 (12) ◽  
pp. 2218-2228 ◽  
Author(s):  
Dvir Shabtay ◽  
Yisrael Itskovich ◽  
Liron Yedidsion ◽  
Daniel Oron
Keyword(s):  
Resource Allocation ◽  
Group Technology ◽  
Due Date ◽  
Due Date Assignment

scholarly journals Solution Algorithms for Single-Machine Group Scheduling with Learning Effect and Convex Resource Allocation

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Wanlei Wang ◽  
Jian-Jun Wang ◽  
Ji-Bo Wang
Keyword(s):  
Resource Allocation ◽  
Single Machine ◽  
Learning Effect ◽  
Group Technology ◽  
Due Date ◽  
Optimal Sequence ◽  
Due Date Assignment ◽  
Solution Algorithms ◽  
Special Cases ◽  
Optimal Resource

This paper deals with a single-machine resource allocation scheduling problem with learning effect and group technology. Under slack due-date assignment, our objective is to determine the optimal sequence of jobs and groups, optimal due-date assignment, and optimal resource allocation such that the weighted sum of earliness and tardiness penalties, common flow allowances, and resource consumption cost is minimized. For three special cases, it is proved that the problem can be solved in polynomial time. To solve the general case of problem, the heuristic, tabu search, and branch-and-bound algorithms are proposed.

scholarly journals Optimization for Due-Date Assignment Single-Machine Scheduling under Group Technology

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Li-Yan Wang ◽  
Mengqi Liu ◽  
Ji-Bo Wang ◽  
Yuan-Yuan Lu ◽  
Wei-Wei Liu
Keyword(s):  
Single Machine ◽  
Group Technology ◽  
Machine Scheduling ◽  
Time Algorithm ◽  
Single Machine Scheduling ◽  
Due Date ◽  
Optimal Sequence ◽  
Due Date Assignment ◽  
The Common ◽  
Slk Due Date Assignment

In this paper, the single-machine scheduling problem is studied by simultaneously considering due-date assignment and group technology (GT). The objective is to determine the optimal sequence of groups and jobs within groups and optimal due-date assignment to minimize the weighted sum of the absolute value in lateness and due-date assignment cost, where the weights are position dependent. For the common (CON) due-date assignment, slack (SLK) due-date assignment, and different (DIF) due-date assignment, an O n    log    n time algorithm is proposed, respectively, to solve the problem, where n is the number of jobs.

Flow Shop Resource Allocation Scheduling with Due Date Assignment, Learning Effect and Position-Dependent Weights

2020 ◽  
Vol 37 (03) ◽  
pp. 2050014
Author(s):  
Wei-Wei Liu ◽  
Chong Jiang
Keyword(s):  
Resource Allocation ◽  
Learning Effect ◽  
Flow Shop ◽  
Due Date ◽  
Due Date Assignment ◽  
Polynomial Time Algorithms ◽  
Optimality Properties ◽  
No Wait ◽  
Special Case ◽  
Order Algorithm

In this paper, the flow shop resource allocation scheduling with learning effect and position-dependent weights on two-machine no-wait setting is considered. Under common due date assignment and slack due date assignment rules, a bi-criteria analysis is provided. The optimality properties and polynomial time algorithms are developed to solve four versions of the problem. For a special case of the problem, it is proved that the problem can be optimally solved by a lower order algorithm.

Optimal coordination of resource allocation, due date assignment and scheduling decisions

Omega ◽  
2016 ◽  
Vol 65 ◽  
pp. 41-54 ◽  
Author(s):  
Dvir Shabtay ◽  
George Steiner ◽  
Rui Zhang
Keyword(s):  
Resource Allocation ◽  
Due Date ◽  
Due Date Assignment ◽  
Optimal Coordination
Sign in / Sign up

Export Citation Format

Share Document