scientific article; zbMATH DE number 1061797

DOI10.1002/(SICI)1520-6750(199709)44:6%3C531::AID-NAV2%3E3.0.CO;2-4zbMATH Open0893.90085MaRDI QIDQ4354550FDOQ4354550

Authors: Xiaoqiang Cai, Sean Zhou 

Publication date: 17 September 1997

Title of this publication is not available (Why is that?)

Recommendations

• Single machine scheduling with stochastic processing times or stochastic due-date to minimize the number of early and tardy jobs
• STOCHASTIC SCHEDULING WITH ASYMMETRIC EARLINESS AND TARDINESS PENALTIES UNDER RANDOM MACHINE BREAKDOWNS
• Minimizing earliness and tardiness costs in stochastic scheduling
• Scheduling problems with random processing times under expected earliness/tardiness costs
• Stochastic single machine JIT scheduling with geometric processing times and due dates

zbMATH Keywords

single machinecommon due dateearliness-tardiness schedulingFibonacci searchstochastic jobsV-shape property

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Cited In (20)

• Trading off due-date tightness and job tardiness in a basic scheduling model
• Setting due dates in a stochastic single machine environment
• Minimizing earliness and tardiness costs in stochastic scheduling
• Minimizing the expected number of tardy jobs when processing times are normally distributed
• Asymmetric earliness and tardiness scheduling with exponential processing times on an unreliable machine
• Sequencing with Earliness and Tardiness Penalties: A Review
• Title not available (Why is that?)
• Single machine scheduling with stochastic processing times or stochastic due-date to minimize the number of early and tardy jobs
• A clearing function based bid-price approach to integrated order acceptance and release decisions
• STOCHASTIC SCHEDULING WITH ASYMMETRIC EARLINESS AND TARDINESS PENALTIES UNDER RANDOM MACHINE BREAKDOWNS
• Solving a stochastic single machine problem with initial idle time and quadratic objective
• Setting optimal due dates in a basic safe-scheduling model
• Scheduling jobs with stochastic processing times and due dates to minimize total tardiness
• Stochastic single machine JIT scheduling with geometric processing times and due dates
• Algorithmic Applications in Management
• Dynamic scheduling of stochastic jobs on a single machine
• OPTIMAL SINGLE-MACHINE SCHEDULING FOR MINIMIZING THE SUM OF EARLINESS AND TARDINESS PENALTIES
• Scheduling problems with random processing times under expected earliness/tardiness costs
• Bi-objective single machine scheduling problem with stochastic processing times
• Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354550)