Single-machine earliness–tardiness scheduling with two competing agents and idle time
Sign Up to like & getrecommendations! Published in 2017 at "Engineering Optimization"
DOI: 10.1080/0305215x.2016.1190353
Abstract: ABSTRACT Two-agent scheduling has gained a lot of research attention recently. Two competing agents who have their own objective functions have to perform their respective set of jobs on one or more shared machines. This… read more here.
Keywords: two competing; competing agents; tardiness; earliness tardiness ... See more keywords
Common due-window assignment for single-machine scheduling with generalized earliness/tardiness penalties and a rate-modifying activity
Sign Up to like & getrecommendations! Published in 2020 at "Engineering Optimization"
DOI: 10.1080/0305215x.2020.1740921
Abstract: ABSTRACT This article investigates the single-machine common due-window assignment problem with generalized earliness/tardiness penalties and a rate-modifying activity. Job processing times include two cases: one with constant values and another with time-dependent processing times (deterioration… read more here.
Keywords: due window; common due; earliness tardiness; single machine ... See more keywords
Minimizing total earliness and tardiness on re-entrant batch processing machine with time windows
Sign Up to like & getrecommendations! Published in 2018 at "Mathematical and Computer Modelling of Dynamical Systems"
DOI: 10.1080/13873954.2017.1394327
Abstract: ABSTRACT The time window (TW) generalizes the concept of due date. The semiconductor wafer fabrication system is currently one of the most complex production processes, which has typical re-entrant batch processing machine (RBPM). RBPM is… read more here.
Keywords: batch processing; total earliness; entrant batch; time ... See more keywords