Computational complexity of the single processor makespan minimization problem with release dates and job-dependent learning

2014 ◽  
Vol 65 (8) ◽  
pp. 1170-1176 ◽  
Author(s):  
R Rudek
Keyword(s):  
Computational Complexity ◽  
Minimization Problem ◽  
Release Dates ◽  
Makespan Minimization ◽  
Dependent Learning ◽  
Single Processor

Scheduling with controllable release dates and processing times: Makespan minimization

2006 ◽  
Vol 175 (2) ◽  
pp. 751-768 ◽  
Author(s):  
T.C. Edwin Cheng ◽  
Mikhail Y. Kovalyov ◽  
Natalia V. Shakhlevich
Keyword(s):  
Release Dates ◽  
Makespan Minimization ◽  
Processing Times ◽  
Controllable Release

Solution algorithms for the makespan minimization problem with the general learning model

2009 ◽  
Vol 56 (4) ◽  
pp. 1301-1308 ◽  
Author(s):  
Adam Janiak ◽  
Władysław Adam Janiak ◽  
Radosław Rudek ◽  
Agnieszka Wielgus
Keyword(s):  
Minimization Problem ◽  
Learning Model ◽  
Makespan Minimization ◽  
Solution Algorithms ◽  
General Learning Model

scholarly journals Minimal and Hyper-Minimal Biautomata

2016 ◽  
Vol 27 (02) ◽  
pp. 161-185
Author(s):  
Markus Holzer ◽  
Sebastian Jakobi
Keyword(s):  
Computational Complexity ◽  
Minimization Problem ◽  
Finite Automata ◽  
Deterministic Finite Automata ◽  
Np Complete ◽  
Carry Over

We compare deterministic finite automata (DFAs) and biautomata under the following two aspects: structural similarities between minimal and hyper-minimal automata, and computational complexity of the minimization and hyper-minimization problem. Concerning classical minimality, the known results such as isomorphism between minimal DFAs, and NL-completeness of the DFA minimization problem carry over to the biautomaton case. But surprisingly this is not the case for hyper-minimization: the similarity between almost-equivalent hyper-minimal biautomata is not as strong as it is between almost-equivalent hyper-minimal DFAs. Moreover, while hyper-minimization is NL-complete for DFAs, we prove that this problem turns out to be computationally intractable, i.e., NP-complete, for biautomata.

Single Machine Group Scheduling Problem with Deteriorating Jobs and Release Dates

2014 ◽  
Vol 513-517 ◽  
pp. 2145-2148 ◽  
Author(s):  
Lu Liu ◽  
Yang Tao Xu ◽  
Na Yin ◽  
Ji Bo Wang
Keyword(s):  
Single Machine ◽  
Group Technology ◽  
Deteriorating Jobs ◽  
Single Machine Scheduling ◽  
Linear Functions ◽  
Release Dates ◽  
Scheduling Problem ◽  
Makespan Minimization ◽  
Processing Times ◽  
Machine Group

The paper deals with a single machine scheduling problem with deteriorating jobs and group technology (GT) assumption. By deteriorating jobs and group technology assumption, we mean that the group setup times and job processing times are both simple linear functions of their starting times. We show that the makespan minimization problem with release dates can be solved in polynomial time.

Sign in / Sign up

Export Citation Format

Share Document