location: Current position: Home >> Scientific Research >> Paper Publications

Single Machine CON/SLK Due Date Assignment Scheduling with Controllable Processing Time and Job-dependent Learning Effects

Hits:

Indexed by:期刊论文

Date of Publication:2018-09-01

Journal:COMPUTER JOURNAL

Included Journals:SCIE

Volume:61

Issue:9

Page Number:1329-1337

ISSN No.:0010-4620

Key Words:scheduling; learning effects; resource allocation; due date assignment

Abstract:This paper addresses resource allocation scheduling problems with CON/SLK due date assignment and job-dependent learning effects on a single machine. Two different resource consumption functions under common (denoted by CON) and slack (denoted by SLK) due date assignment are considered. The objective is to determine the optimal due dates of jobs, a sequence for jobs and resource allocation of jobs to minimize a total cost function. The optimality properties for all problems and polynomial time algorithms are proposed to solve these problems.

Pre One:随机急诊需求下基于分支定价算法的手术计划研究

Next One:Makespan minimization scheduling with ready times, group technology and shortening job processing times