Pages that link to "Item:Q1097833"

The following pages link to Optimal common due-date with limited completion time deviation (Q1097833):

Displaying 31 items.

• Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times (Q505770) (← links)
• Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration (Q613268) (← links)
• On scheduling around large restrictive common due windows (Q704121) (← links)
• Optimal common due-date with limited completion time (Q753672) (← links)
• CON due-date determination and sequencing (Q908841) (← links)
• An algorithm for the CON due-date determination and sequencing problem (Q1097162) (← links)
• Minimizing the maximum deviation of job completion time about a common due-date (Q1098766) (← links)
• A note on ``Minimizing the maximum deviation of job completion time about a common due-date'' (Q1104852) (← links)
• Survey of scheduling research involving due date determination decisions (Q1111925) (← links)
• A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date (Q1195100) (← links)
• Determination of common due window location in a single machine scheduling problem (Q1268196) (← links)
• Due window scheduling for parallel machines (Q1341402) (← links)
• Earliness-tardiness scheduling problems with a common delivery window (Q1342083) (← links)
• Optimal common due-date with completion time tolerance (Q1360136) (← links)
• Single machine scheduling with common due data assignment in a group technology environment (Q1368494) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (Q1652188) (← links)
• Two-stage medical supply chain scheduling with an assignable common due window and shelf life (Q1740417) (← links)
• Single machine scheduling with symmetric earliness and tardiness penalties (Q1869413) (← links)
• Soft due window assignment and scheduling of unit-time jobs on parallel machines (Q1935552) (← links)
• An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time (Q2084598) (← links)
• Scheduling with monotonous earliness and tardiness penalties (Q2366084) (← links)
• Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance (Q2379661) (← links)
• Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times (Q2462556) (← links)
• A two-echelon inventory optimization model with demand time window considerations (Q2574100) (← links)
• Single-Machine Scheduling Problems Simultaneous with Deteriorating and Learning Effects Under a Deteriorating Maintenance Consideration (Q2958667) (← links)
• On Optimal Common Due-Date Determination (Q3760290) (← links)
• Minimizing total earliness and tardiness on re-entrant batch processing machine with time windows (Q5861097) (← links)
• Single-machine scheduling with a common due window (Q5926034) (← links)
• Parallel machine scheduling with a common due window (Q5953340) (← links)
• A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing (Q6547128) (← links)