Solution Algorithms for Single-Machine Group Scheduling with Learning Effect and Convex Resource Allocation
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...
Saved in:
Main Authors: | Wanlei Wang, Jian-Jun Wang, Ji-Bo Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2021/6615824 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Optimization for Due-Date Assignment Single-Machine Scheduling under Group Technology
by: Li-Yan Wang, et al.
Published: (2021-01-01) -
Online Scheduling on a Single Machine with Grouped Processing Times
by: Qijia Liu, et al.
Published: (2015-01-01) -
Discrete resource allocation to groups of customers
by: Vytautas Tiešis
Published: (2005-12-01) -
Human Resource Allocation Based on Fuzzy Data Mining Algorithm
by: You Wu, et al.
Published: (2021-01-01) -
Efficient Solution Algorithms for Resource Planning and Scheduling in Seasonal Reservation Systems
by: Uğur Eliiyi
Published: (2025-01-01)