LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Common due-window assignment for single-machine scheduling with generalized earliness/tardiness penalties and a rate-modifying activity

Photo from wikipedia

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… Click to show full 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 effect). Considering the maintenance activity, the maintenance time is a fixed constant. The goal is to determine the position of the common due window and the optimal sequence such that the following objective function is minimized: the weighted penalties for the sum of earliness and tardiness, the weighted number of early and delayed, and the weighted due-window starting time and size. It is proved that the problem can be solved in time, where n is the number of jobs.

Keywords: due window; common due; earliness tardiness; single machine; activity

Journal Title: Engineering Optimization
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.