Due dates assignment and JIT scheduling with equal-size jobs

DOI10.1016/J.EJOR.2010.01.016zbMATH Open1188.90113OpenAlexW1990496452MaRDI QIDQ976442FDOQ976442

Authors: Nguyen Huynh Tuong, A. Soukhal 

Publication date: 11 June 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.01.016

Recommendations

• Due-date assignment on uniform machines
• Two due date assignment problems in scheduling a single machine
• Just-in-time scheduling with equal-size jobs
• Due-date assignment and early/tardy scheduling on identical parallel machines
• Parallel machine scheduling to minimize costs for earliness and number of tardy jobs

zbMATH Keywords

polynomial-time algorithmsmulti-processor schedulingdue dates assignmentearliness-tardiness penalty

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Title not available (Why is that?)
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
• Multicriteria scheduling problems: a survey
• A new approach to the maximum-flow problem
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
• Sequencing with Earliness and Tardiness Penalties: A Review
• Title not available (Why is that?)
• Due-date assignment on uniform machines
• A Fast and Simple Algorithm for the Maximum Flow Problem

Cited In (18)

• Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
• Due-date assignment on uniform machines
• Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment
• Just-in-time scheduling with equal-size jobs
• An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs
• A Bicriterion Approach to Due Date Assignment Scheduling in Single-Machine with Position-Dependent Weights
• Complexities of four problems on two-agent scheduling
• Just-in-time scheduling with generalized due dates and identical due date intervals
• A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
• Scheduling problems with two competing agents to minimized weighted earliness-tardiness
• Due-window assignment problems with unit-time jobs
• A survey on scheduling problems with due windows
• Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms
• Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
• Single-machine common flow allowance scheduling with aging effect, resource allocation, and a rate-modifying activity
• Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties
• Due-window assignment with identical jobs on parallel uniform machines
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains

This page was built for publication: Due dates assignment and JIT scheduling with equal-size jobs

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