Due dates assignment and JIT scheduling with equal-size jobs

From MaRDI portal
Publication:976442

DOI10.1016/j.ejor.2010.01.016zbMath1188.90113OpenAlexW1990496452MaRDI 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




Related Items (15)

Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion timeA survey on scheduling problems with due windowsScheduling problems with two competing agents to minimized weighted earliness-tardinessComplexities of four problems on two-agent schedulingA Bicriterion Approach to Due Date Assignment Scheduling in Single-Machine with Position-Dependent WeightsJust-in-Time Scheduling with Equal-Size JobsDue-window assignment problems with unit-time jobsAn improved algorithm for due-window assignment on parallel identical machines with unit-time jobsScheduling with common due date assignment to minimize generalized weighted earliness-tardiness penaltiesA common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problemsSingle‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activitySolving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithmsSINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENTMinimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chainsDue-window assignment with identical jobs on parallel uniform machines



Cites Work


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