A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios

This article considers a job scheduling problem arising in JIT context where a job may incur both earliness and tardiness penalty and these penalties are dependent on the job as well as amount of earliness and tardiness. Special cases of the problems have been shown to be NP-Complete. To the best of...

Full description

Saved in:
Bibliographic Details
Published in:Opsearch Vol. 46; no. 4; pp. 418 - 427
Main Author: Mondal, Sakib A.
Format: Journal Article
Language:English
Published: India Springer-Verlag 01.12.2009
OperationalResearch Society of India
Springer Nature B.V
Subjects:
Algorithms
Approximation
Business and Management
Management
Mathematical analysis
Mathematics
Operations Research/Decision Theory
Scheduling
Studies
Theory and Methodology
Just-in-time
Fully polynomial approximation scheme
Scheduling
ISSN:0030-3887, 0975-0320
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This article considers a job scheduling problem arising in JIT context where a job may incur both earliness and tardiness penalty and these penalties are dependent on the job as well as amount of earliness and tardiness. Special cases of the problems have been shown to be NP-Complete. To the best of our knowledge, there is no fully polynomial approximation scheme (FPTAS) for this problem. This article proposes a FPTAS for the problem.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0030-3887
0975-0320
DOI:10.1007/s12597-009-0026-x