Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
December 19, 2025journal of the college of basic educationOpen Access

Theoretical Approach For Solving Scheduling On Unrelated Parallel Machines With Release Dates To Minimize Four Criterions

View Full Paper
Ask AI
Bookmark
Share

Authors

HHHadi Hassan HadiMKMarwa B. kadhemHCHanan Ali Chachan

Discussion

Loading...

Member takes

Overview

Theoretical approach minimizes tardiness and flow time in scheduling jobs on unrelated machines, indicating effectiveness in multi-objective problems.

Key Points

  • This research aims to develop a theoretical framework for scheduling jobs on unrelated parallel machines.
  • Proposes a novel scheduling approach for jobs in a cutting workshop.
  • Focuses on minimizing flow time, tardiness, earliness, and late work under the constraints of release dates.
  • Utilizes randomly generated job and machine instances for evaluation.
  • Demonstrates the efficacy of the proposed scheduling approach in minimizing tardiness and flow time.
  • Results suggest that the theoretical model can handle multiple objectives effectively in scheduling contexts.

Cite This Study

Hadi et al. (2025) studied this question.

synapsesocial.com/papers/69449a892f0218eca95082fehttps://doi.org/10.35950/cbej.v30i133.13988
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Unrelated parallel machine scheduling under machine availability and eligibility constraints to minimize the makespan of non-resumable jobs2024 · 3 citations
  2. 2Multiobjective unrelated parallel machines scheduling problem with periodic maintenance activities and dependent processing times2024 · 4 citations
  3. 3Optimizing parallel batch scheduling on uniform machines: A focus on equal job durations with varied release dates and sizes2026
  4. 4Parallel-batch scheduling with release dates and rejection on identical parallel machines2026
  5. 5Job scheduling on Identical Parallel Machines to Minimize Total Tardiness2024