International Journal of Production Research · 2015 · 20 citations · 26 references
ManagementIndustrial EngineeringOperations ManagementOptimizationProduction PlanningSchedulingJob SchedulingJob SequencingMachine SchedulingResource SchedulingResource-constrained SchedulingScheduling TheoryDue DatesDue-date Based SchedulingPolynomial Time ComplexityPolynomial-time AlgorithmsScheduling With Due DatesSingle-machine Due-date SchedulingSingle-machine SchedulingSingle-machine Tardiness Scheduling
This is a study of a earliness and tardiness sequencing and scheduling problem on a single machine. The processing time for job depends on its position in a sequence, its starting time, and its allocation of non-renewable resource. For three due date assignment methods i.e. the common due date, the slack due date and the unrestricted due date our goal is to find the optimal schedule, due dates, and resource allocations of jobs. We prove that three versions of the problem can be solved in polynomial time, respectively.
26
Scheduling: Theory, Algorithms, and Systems
Michael Pinedo · IIE Transactions · 1996 · 6.3K citations