ScholarLens Back to search
2014•Unpublished venueRequires access

An application framework for scheduling optimization problems

Oguzhan Kocatepe

Open publisher page 5 citations

Abstract

[1] Sequencing is the process of defining the order in which the set of jobs to be completed are done. Scheduling is the process of adding start and finish information to the job order dictated by the sequence. There are 5 basic types of scheduling: Single Machine Scheduling; Parallel Machine Scheduling; Open Shop Scheduling; Flow Shop Scheduling; and Job Shop Scheduling. This paper is about the implementation of the algorithms for these basic scheduling and types and developing heuristic approaches to more complex scheduling problems. [2] A heuristic is an algorithm which tries but not guarantees to find the optimum solution but gives good results for NP-hard or NP-complete problems. NP means non-deterministically polynomial time.

About this research paper

What this paper is about

[1] Sequencing is the process of defining the order in which the set of jobs to be completed are done. Scheduling is the process of adding start and finish information to the job order dictated by the sequence. There are 5 basic types of scheduling: Single Machine Scheduling; Parallel Machine Scheduling; Open Shop Scheduling; Flow Shop Scheduling; and Job Shop Scheduling. This paper is about the implementation of the algorithms for these basic scheduling and types and developing heuristic approaches to more complex scheduling problems. [2] A heuristic is an algorithm which tries but not guarantees to find the optimum solution but gives good results for NP-hard or NP-complete problems. NP means non-deterministically polynomial time.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

[1] Sequencing is the process of defining the order in which the set of jobs to be completed are done. Scheduling is the process of adding start and finish information to the job order dictated by the sequence. There are 5 basic types of scheduling: Single Machine Scheduling; Parallel Machine Scheduling; Open Shop Scheduling; Flow Shop Scheduling; and Job Shop Scheduling. This paper is about the implementation of the algorithms for these basic scheduling and types and developing heuristic approaches to more complex scheduling problems. [2] A heuristic is an algorithm which tries but not guarantees to find the optimum solution but gives good results for NP-hard or NP-complete problems. NP means non-deterministically polynomial time.

Key concepts: Computer science, Scheduling (production processes), Distributed computing, Mathematical optimization, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An application framework for scheduling optimization problems — Research Paper | ScholarLens