Scheduling to minimize the total compression and late costs

DOI10.1002/(SICI)1520-6750(199802)45:1%3C67::AID-NAV4%3E3.0.CO;2-JMaRDI QIDQ4381876zbMATH OpenOpenAlexFDO

Authors T. C. Edwin Cheng, Zhi-Long Chen, Chung-Lun Li, B. M. T. Lin

Publication date 25 March 1998

Full work available at URL https://doi.org/10.1002/(sici)1520-6750(199802)45:1%3C67::aid-nav4%3E3.0.co;2-j

zbMATH Keywords

heuristicsdue datesNP-hardsingle-machine schedulingfully polynomial approximation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
• Scheduling to minimize release-time resource consumption and tardiness penalties
• scientific article; zbMATH DE number 3904315
• Scheduling with compressible and stochastic release dates
• Scheduling with discretely compressible release dates to minimize makespan
• Scheduling to minimize the maximum total completion time per machine
• scientific article; zbMATH DE number 2080224
• Scheduling to minimize makespan about increase of processing times
• Rescheduling to minimize the maximum weighted completion time
• Batch scheduling to minimize maximum lateness

Cited in

(25)

• Scheduling to minimize release-time resource consumption and tardiness penalties
• Scheduling with controllable release dates and processing times: total completion time minimization
• Scheduling two projects with controllable processing times in a single-machine environment
• Single-machine scheduling with trade-off between number of tardy jobs and compression cost
• Single CNC machine scheduling with controllable processing times and multiple due dates
• Single machine batch scheduling with jointly compressible setup and processing times.
• Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times
• Single machine batch scheduling with resource dependent setup and processing times
• Scheduling with compressible and stochastic release dates
• A survey of scheduling with controllable processing times
• scientific article; zbMATH DE number 834592 (Why is no real title available?)
• Two‐agent scheduling with linear resource‐dependent processing times
• Single machine group scheduling with resource dependent setup and processing times
• Single machine scheduling with discretely controllable processing times
• Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
• Minimizing total tardiness on a single machine with controllable processing times
• Complexity of a scheduling problem with controllable processing times
• Group scheduling with controllable setup and processing times: minimizing total weighted completion time
• Single-machine scheduling of multiple projects with controllable processing times
• Scheduling with discretely compressible release dates to minimize makespan
• Fully polynomial time (,)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs
• Inverse interval scheduling via reduction on a single machine
• Single–machine scheduling with random machine breakdowns and randomly compressible processing times
• Scheduling with controllable processing times and compression costs using population-based heuristics
• Approximation schemes for job shop scheduling problems with controllable processing times

This page was built for publication: Scheduling to minimize the total compression and late costs

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