Optimal policies for minimizing total job completion times and deviations from common due dates in unrelated parallel machine scheduling

DOI10.1007/S12597-024-00750-8MaRDI QIDQ6613982zbMATH OpenFDO

Authors Oğuzhan Ahmet Arık

Publication date 7 October 2024

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S12597-024-00750-8

zbMATH Keywords

common due dateearlinessoptimal policytardinessthe sum of completion timesunrelated parallel machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
• Simultaneous minimization of total completion time and total deviation of job completion times
• A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
• Minimizing total tardiness in an unrelated parallel-machine scheduling problem
• Scheduling under a common due-date on parallel unrelated machines

Cites work

• A heuristic for single machine common due date assignment problem with different earliness/tardiness weights
• A new method for solving fully fuzzy linear programming problems
• A single machine group scheduling problem with due date assignment and position-dependent costs
• A tabu search algorithm for parallel machine total tardiness problem
• Chance constrained programming with fuzzy parameters
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Dominance inequalities for scheduling around an unrestrictive common due date
• Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs
• Early/tardy scheduling with sequence dependent setups on uniform parallel machines
• Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
• scientific article; zbMATH DE number 5310775 (Why is no real title available?)
• scientific article; zbMATH DE number 4081292 (Why is no real title available?)
• Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
• Multiple-machine scheduling with earliness, tardiness and completion time penalties
• Parallel machine scheduling with earliness and tardiness penalties
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
• Scheduling on parallel identical machines to minimize total tardiness
• Scheduling under a common due-date on parallel unrelated machines
• Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost
• Scheduling unrelated parallel machines to minimize total weighted tardiness.
• Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
• Single-machine due-date assignment scheduling with generalized earliness-tardiness penalties including proportional setup times
• The concept of a linguistic variable and its application to approximate reasoning. I
• The due date assignment scheduling problem with the deteriorating jobs and delivery time
• Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria

This page was built for publication: Optimal policies for minimizing total job completion times and deviations from common due dates in unrelated parallel machine scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6613982)