2019DOAJ (DOAJ: Directory of Open Access Journals)Requires access

Dissatisfaction levels of earliness and tardiness durations by relaxing common due date on single machine scheduling problems

Oğuzhan Ahmet Arık

Open publisher page 2 citations

Abstract

This\npaper investigates single machine earliness/tardiness problem considering the\ndecision maker’s tolerances for earliness and tardiness durations in case of a\nrestrictive common due date. In many classical or basic earliness/tardiness\nproblems, due dates are accepted as deterministic or rigid numbers. In this\npaper, common due date in a single machine scheduling problem is relaxed with\nlower and upper bounds and these bounds are used for illustrating the decision\nmaker’s tolerances or satisfaction levels by using fuzzy sets. As a\ncomplementary set of satisfaction levels, dissatisfaction levels can be encoded\nwith fuzzy sets. Then, this paper uses dissatisfaction levels in order to\nintroduce a new objective criterion that minimizes the products of earliness\nand tardiness durations with dissatisfaction levels.

About this research paper

What this paper is about

This\npaper investigates single machine earliness/tardiness problem considering the\ndecision maker’s tolerances for earliness and tardiness durations in case of a\nrestrictive common due date. In many classical or basic earliness/tardiness\nproblems, due dates are accepted as deterministic or rigid numbers. In this\npaper, common due date in a single machine scheduling problem is relaxed with\nlower and upper bounds and these bounds are used for illustrating the decision\nmaker’s tolerances or satisfaction levels by using fuzzy sets. As a\ncomplementary set of satisfaction levels, dissatisfaction levels can be encoded\nwith fuzzy sets. Then, this paper uses dissatisfaction levels in order to\nintroduce a new objective criterion that minimizes the products of earliness\nand tardiness durations with dissatisfaction levels.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This\npaper investigates single machine earliness/tardiness problem considering the\ndecision maker’s tolerances for earliness and tardiness durations in case of a\nrestrictive common due date. In many classical or basic earliness/tardiness\nproblems, due dates are accepted as deterministic or rigid numbers. In this\npaper, common due date in a single machine scheduling problem is relaxed with\nlower and upper bounds and these bounds are used for illustrating the decision\nmaker’s tolerances or satisfaction levels by using fuzzy sets. As a\ncomplementary set of satisfaction levels, dissatisfaction levels can be encoded\nwith fuzzy sets. Then, this paper uses dissatisfaction levels in order to\nintroduce a new objective criterion that minimizes the products of earliness\nand tardiness durations with dissatisfaction levels.

Key concepts: Tardiness, Due date, Mathematical optimization, Single-machine scheduling, Scheduling (production processes), Fuzzy logic, Retard, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Dissatisfaction levels of earliness and tardiness durations by relaxing common due date on single machine scheduling problems — Research Paper | ScholarLens