Proceedings ArticleDOI
Scheduling with common due date assignment
Valery Gordon,Jean-Marie Proth,Gerd Finke,Chengbin Chu +3 more
- pp 553-557
Reads0
Chats0
TLDR
This work considers single machine scheduling problems in which due dates are assigned according to the CON (common due date) rule to find an optimal value of the due date and the related optimal schedule in order to optimize a given criterion based on the due Date and the completion times of jobs.Abstract:
We consider single machine scheduling problems in which due dates are assigned according to the CON (common due date) rule. The objective in this problem is to find an optimal value of the due date and the related optimal schedule in order to optimize a given criterion based on the due date and the completion times of jobs.read more
Citations
More filters
Journal ArticleDOI
Two-agent single-machine scheduling with assignable due dates
TL;DR: This work considers several two-agent scheduling problems with assignable due dates on a single machine, where each of the agents wants to minimize a measure depending on the completion times of its own jobs and the due dates are treated as given variables and must be assigned to individual jobs.
Journal ArticleDOI
Four single-machine scheduling problems involving due date determination decisions
TL;DR: The structural properties of the optimal schedules are derived and it is shown that the variants TETDC, TEWNTDC and TEW NTDS are all polynomially solvable and the complexity status of the variant WNTDD is still open, but it is also shown that two special cases of it are polynomegal solvable.
Journal ArticleDOI
Multi-agent single-machine scheduling and unrestricted due date assignment with a fixed machine unavailability interval
TL;DR: P pseudo-polynomial dynamic programming (DP) solution algorithms and mixed integer linear programming (MILP) formulations for the considered problems are devised and the performance of the DP solution algorithms against the corresponding MILP formulations with randomly generated instances is compared.
Journal ArticleDOI
Exponential neighborhood search for a parallel machine scheduling problem
TL;DR: An exponential size neighborhood is defined for the parallel machine scheduling problem where jobs have different earliness-tardiness penalties and a restrictive common due date and it is proved that finding the local minimum in it is an NP-hard problem.
Posted Content
Equilibrium and efficient clustering of arrival times to a queue.
TL;DR: The prevalence of a pure symmetric equilibrium is shown to be robust to several relaxations of the assumptions: inclusion of small waiting costs, stochastic job sizes, random sized population, heterogeneous due dates and non-linear deviation penalties.
References
More filters
BookDOI
Toyota production system
TL;DR: This new edition of Toyota Production System: An Integrated Approach to Just-In-Time updates the classic with new material on e-kanban, mini-profit centers, computer-based information systems, and innovative solutions to common obstacles in TPS implementation.
Journal ArticleDOI
Sequencing with Earliness and Tardiness Penalties: A Review
Kenneth R. Baker,Gary D. Scudder +1 more
TL;DR: A framework to show how results have been generalized starting with a basic model that contains symmetric penalties, one machine and a common due date is provided and such features as parallel machines, complex penalty functions and distinct due dates are added.
Book
Scheduling Computer and Manufacturing Processes
TL;DR: In this paper, a theoretical and application oriented analysis of deterministic scheduling problems arising in computer and manufacturing environments is presented and discussed, where different problem parameters such as task processing times, urgency weights, arrival times, deadlines, precedence constraints, and processor speed factor are involved.
Journal ArticleDOI
Survey of scheduling research involving due date determination decisions
T.C.E. Cheng,Mahesh Gupta +1 more
TL;DR: A critical review of a particular segment of scheduling research in which the due to date assignment decision is of primary interest is presented, observing that while the static single- machine problem with constant or common due dates has been well researched, very little or no work has been done on the dynamic multi-machine problem with sophisticated due date assignment methods.
Journal ArticleDOI
A survey of the state-of-the-art of common due date assignment and scheduling research
TL;DR: A unified framework of the common due date assignment and scheduling problems in the deterministic case is provided by surveying the literature concerning the models involving single machine and parallel machines by finding an optimal value of thecommon due date and the related optimal schedule.
Related Papers (5)
Single machine scheduling to minimise resource consumption cost with a bound on scheduling plus due date assignment penalties
Shlomo Karhi,Dvir Shabtay +1 more