2014
DOI: 10.12720/jiii.3.3.173-180
|View full text |Cite
|
Sign up to set email alerts
|

Process Planning and Scheduling with SLK Due-Date Assignment where Earliness, Tardiness and Due-Dates are Punished

Abstract: Traditionally process planning, scheduling and due date assignment are treated separately. Some works are done on integrated process planning and scheduling and on scheduling with due-date assignment. However integrating all of these functions is not treated. Since scheduling problems alone belong to NP-hard class problems, integrated problems are even harder to solve. In this study process planning and scheduling and SLK due date assignment are integrated using genetic algorithms and Random search techniques.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
10
0
1

Year Published

2017
2017
2019
2019

Publication Types

Select...
6

Relationship

3
3

Authors

Journals

citations
Cited by 10 publications
(11 citation statements)
references
References 47 publications
0
10
0
1
Order By: Relevance
“…That is why exact solutions are only possible for only very small sized problems and researchers uses some heuristics to find a good solution in a reasonable amount of time. According to [5], "If we look at the literature we see that it is hard to solve integrated problems. Some solutions are only possible for small problems.…”
Section: Literature Review On Integrated Problemsmentioning
confidence: 99%
“…That is why exact solutions are only possible for only very small sized problems and researchers uses some heuristics to find a good solution in a reasonable amount of time. According to [5], "If we look at the literature we see that it is hard to solve integrated problems. Some solutions are only possible for small problems.…”
Section: Literature Review On Integrated Problemsmentioning
confidence: 99%
“…As (Demir, Uygun, Cil, Ipek & Sari, 2015) mentioned, if we look at literature for IPPS problems we can observe that some researchers use genetic algorithm, some use evolutionary algorithms or agent based solutions to the problem. Some of the researchers decomposed the problem into smaller parts such as loading and scheduling sub problems.…”
Section: Background and Related Researchesmentioning
confidence: 99%
“…Later Demir et al [6] worked on the integration of process planning and due date assignment with ATC (Apparent Tardiness Cost) dispatching. Demir et al [7] studied the integration of process planning and scheduling with SLK (Slack) due date assignment. In these studies unique due dates are determined for every customer.…”
Section: Literature Surveymentioning
confidence: 99%
“…They decompose problems into loading and scheduling subproblems. They use mixed integer programming at the loading part and heuristics at the scheduling part" Demir et al [7]. If we look at the early works on IPPS problem, we can see the following literature on this problem; Nasr and Elsayed [10], Hutchinson et al [11], Chen and Khoshnevis [12], Zhang and Mallur [1], Brandimarte [13], Morad and Zalzala [14].…”
Section: Literature Surveymentioning
confidence: 99%