Single machine scheduling jobs with a truncated sum-of-processing-times- based learning effect

Lin Li; Sheng Wu Yang; Yu Bin Wu; Yunzhang Huo; Ping Ji

doi:10.1007/s00170-013-4772-9

Single machine scheduling jobs with a truncated sum-of-processing-times- based learning effect

Lin Li, Sheng Wu Yang, Yu Bin Wu, Yunzhang Huo, Ping Ji

Research output: Journal article publication › Journal article › Academic research › peer-review

13 Citations (Scopus)

Abstract

In this note, we consider a single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations. We show that even with the introduction of the proposed model to job processing times, several single-machine problems remain polynomially solvable. For the following objective functions, the discounted total weighted completion time, the maximum lateness, we present heuristics according to the corresponding problems without learning effect. We also analyze the worst-case bound of our heuristics.

Original language	English
Pages (from-to)	261-267
Number of pages	7
Journal	International Journal of Advanced Manufacturing Technology
Volume	67
Issue number	1-4
DOIs	https://doi.org/10.1007/s00170-013-4772-9
Publication status	Published - 1 Jul 2013

Keywords

Learning effect
Scheduling
Single machine

ASJC Scopus subject areas

Industrial and Manufacturing Engineering
Control and Systems Engineering
Computer Science Applications
Software
Mechanical Engineering

More information

10.1007/s00170-013-4772-9

Cite this

@article{50386e31e6c14c8696aa82f19f29f77a,

title = "Single machine scheduling jobs with a truncated sum-of-processing-times- based learning effect",

abstract = "In this note, we consider a single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations. We show that even with the introduction of the proposed model to job processing times, several single-machine problems remain polynomially solvable. For the following objective functions, the discounted total weighted completion time, the maximum lateness, we present heuristics according to the corresponding problems without learning effect. We also analyze the worst-case bound of our heuristics.",

keywords = "Learning effect, Scheduling, Single machine",

author = "Lin Li and Yang, {Sheng Wu} and Wu, {Yu Bin} and Yunzhang Huo and Ping Ji",

year = "2013",

month = jul,

day = "1",

doi = "10.1007/s00170-013-4772-9",

language = "English",

volume = "67",

pages = "261--267",

journal = "International Journal of Advanced Manufacturing Technology",

issn = "0268-3768",

publisher = "Springer London",

number = "1-4",

}

TY - JOUR

T1 - Single machine scheduling jobs with a truncated sum-of-processing-times- based learning effect

AU - Li, Lin

AU - Yang, Sheng Wu

AU - Wu, Yu Bin

AU - Huo, Yunzhang

AU - Ji, Ping

PY - 2013/7/1

Y1 - 2013/7/1

N2 - In this note, we consider a single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations. We show that even with the introduction of the proposed model to job processing times, several single-machine problems remain polynomially solvable. For the following objective functions, the discounted total weighted completion time, the maximum lateness, we present heuristics according to the corresponding problems without learning effect. We also analyze the worst-case bound of our heuristics.

AB - In this note, we consider a single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations. We show that even with the introduction of the proposed model to job processing times, several single-machine problems remain polynomially solvable. For the following objective functions, the discounted total weighted completion time, the maximum lateness, we present heuristics according to the corresponding problems without learning effect. We also analyze the worst-case bound of our heuristics.

KW - Learning effect

KW - Scheduling

KW - Single machine

UR - http://www.scopus.com/inward/record.url?scp=84888364568&partnerID=8YFLogxK

U2 - 10.1007/s00170-013-4772-9

DO - 10.1007/s00170-013-4772-9

M3 - Journal article

SN - 0268-3768

VL - 67

SP - 261

EP - 267

JO - International Journal of Advanced Manufacturing Technology

JF - International Journal of Advanced Manufacturing Technology

IS - 1-4

ER -

Single machine scheduling jobs with a truncated sum-of-processing-times- based learning effect

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this