An algorithm for the CON due-date determination and sequencing problem
Computers and Operations Research
Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
Discrete Applied Mathematics - Special issue on new frontiers in the theory and practice of combinatorial optimization: applications in manufacturing and VLSI design
A common due-date assignment problem on parallel identical machines
Computers and Operations Research
Common due date assignment and scheduling with ready times
Computers and Operations Research
Single machine scheduling with a variable common due date and resource-dependent processing times
Computers and Operations Research
A note on a due-date assignment on a two-machine flow-shop
Computers and Operations Research
A note: Common due date assignment for a single machine scheduling with the rate-modifying activity
Computers and Operations Research
Single machine common flow allowance scheduling with a rate-modifying activity
Computers and Industrial Engineering
Two due date assignment problems with position-dependent processing time on a single-machine
Computers and Industrial Engineering
Due-date assignment and maintenance activity scheduling problem
Mathematical and Computer Modelling: An International Journal
Mathematical and Computer Modelling: An International Journal
Two due date assignment problems in scheduling a single machine
Operations Research Letters
Scheduling with due date assignment under special conditions on job processing
Journal of Scheduling
Computers and Industrial Engineering
Hi-index | 0.00 |
e consider a single-machine batch delivery scheduling and common due date assignment problem. In addition to making decisions on sequencing the jobs, determining the common due date, and scheduling job delivery, we consider the option of performing a rate-modifying activity on the machine. The processing time of a job scheduled after the rate-modifying activity decreases depending on a job-dependent factor. Finished jobs are delivered in batches. There is no capacity limit on each delivery batch, and the cost per batch delivery is fixed and independent of the number of jobs in the batch. The objective is to find a common due date for all the jobs, a location of the rate-modifying activity, and a delivery date for each job to minimize the sum of earliness, tardiness, holding, due date, and delivery cost. We provide some properties of the optimal schedule for the problem and present polynomial algorithms for some special cases.