Work

Dynamic Programming Algorithms for Solving Single Machine Scheduling Problems with a Fixed Complexity Time

Year: 2009

Type: article

Abstract: We solvein this paper some machine scheduling problems with certain conditions; the solution had been made by using dynamic programming procedures with a fixed time for all the algorithms. Some of the algorithms described in the paper represent a modification to some mathematical programming algorithms and some of them are new or a generalization to others. The optimal solution of all these algorithms will be done with a fixed complexity time, which may lead us to solve them easier and faster.

Source: Maǧallaẗ al-rāfidayn li-ʿulūm al-ḥāsibāt wa-al-riyāḍiyyāẗ/Al-Rafidain journal for computer sciences and mathematics

DOI: 10.33899/csmj.2009.163796

Author: Kawa Al-Qazilchy

Institution: Salahaddin University-Erbil

Language: English

Topic: Scheduling and Optimization Algorithms

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $100

OpenAlex ID: W2182265650