Single machine common flow allowance scheduling with controllable processing times

DOI10.1007/BF02896403MaRDI QIDQ2504094zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 22 September 2006

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02896403

zbMATH Keywords

SLK due date assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Recommendations

• Single machine scheduling with common due date and controllable processing times
• Single Machine Common Due Window Scheduling with Controllable Job Processing Times
• Single machine scheduling problems with controllable processing times and total absolute differences penalties
• Single-machine sequencing with controllable processing times
• Single machine due-window assignment and scheduling with controllable processing times

Cites work

• A bicriterion approach to time/cost trade-offs in sequencing
• A survey of results for sequencing problems with controllable processing times
• A two-machine flow shop scheduling problem with controllable job processing times
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Minimizing the total weighted flow time in a single machine with controllable processing times
• Resource optimal control in some single-machine scheduling problems
• Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
• Single machine batch scheduling with jointly compressible setup and processing times.
• Single machine scheduling with a variable common due date and resource-dependent processing times.
• Single Machine Scheduling with Flow Allowances
• Single-machine sequencing with controllable processing times
• Some comments on sequencing with controllable processing times
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy

Cited in

(12)

• Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance
• A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
• Single machine scheduling with common due date and controllable processing times
• Unrelated parallel-machine scheduling with controllable processing times and impact of deteriorating maintenance activities under consideration
• Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
• A note: minmax due-date assignment problem with lead-time cost
• Batch scheduling of identical jobs with controllable processing times
• Single Machine Common Due Window Scheduling with Controllable Job Processing Times
• Single Machine Scheduling with Flow Allowances
• Single-machine common flow allowance scheduling with aging effect, resource allocation, and a rate-modifying activity
• Research on multiple slack due-date assignments scheduling with position-dependent weights
• Single machine scheduling problems with controllable processing times and total absolute differences penalties

This page was built for publication: Single machine common flow allowance scheduling with controllable processing times

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