Due dates assignment and JIT scheduling with equal-size jobs

DOI10.1016/j.ejor.2010.01.016zbMath1188.90113MaRDI QIDQ976442

Nguyen Huynh Tuong, Ameur 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

zbMATH Keywords

polynomial-time algorithms; multi-processor scheduling; due dates assignment; earliness-tardiness penalty

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT, Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity, A Bicriterion Approach to Due Date Assignment Scheduling in Single-Machine with Position-Dependent Weights, Scheduling problems with two competing agents to minimized weighted earliness-tardiness, Due-window assignment problems with unit-time jobs, Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time, Complexities of four problems on two-agent scheduling, Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties, A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems, Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms, Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains, Due-window assignment with identical jobs on parallel uniform machines, An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs, A survey on scheduling problems with due windows, Just-in-Time Scheduling with Equal-Size Jobs

Cites Work

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