Descrption

We have n tasks. Each task has 3 parameters:

Cmax - max executive time of all tasks

This alghorithm designate permutation of all tasks where final completion time is minimal (Cmax). The program is based on binary min and max heaps.

Schrage - no task interruption, Schrage_prmt - task interruption is possible

Name		Name	Last commit message	Last commit date
Latest commit History 5 Commits
.gitignore		.gitignore
Heap.cpp		Heap.cpp
Heap.h		Heap.h
Project1.dev		Project1.dev
Project1.layout		Project1.layout
README.md		README.md
Schrage.cpp		Schrage.cpp
Schrage.dev		Schrage.dev
Schrage.h		Schrage.h
Schrage.layout		Schrage.layout
Task.cpp		Task.cpp
Task.h		Task.h
data.txt		data.txt
main.cpp		main.cpp
maxHeap.cpp		maxHeap.cpp
maxHeap.h		maxHeap.h
minHeap.cpp		minHeap.cpp
minHeap.h		minHeap.h
prmtS.cpp		prmtS.cpp
prmtS.h		prmtS.h
result.txt		result.txt

Provide feedback