Scheduling a single server in a two-machine flow shop

DOI10.1007/S00607-002-1467-8MaRDI QIDQ424733zbMATH OpenOpenAlexFDO

Authors T. C. Edwin Cheng, M. Y. Kovalyov

Publication date 4 June 2012

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00607-002-1467-8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Scheduling a single server and equal processing times in a two-machine flow-shop
• Two-machine flow-shop scheduling problems with minimizing the total completion times
• The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
• Scheduling for parallel dedicated machines with a single server
• Scheduling with multiple servers

Cited in

(16)

• Single-server parallel-machine scheduling with loading and unloading times
• Scheduling the production of two-component jobs on a single machine
• Parallel machine scheduling with a single server: loading and unloading
• scientific article; zbMATH DE number 1839523 (Why is no real title available?)
• Complexity results for flow-shop problems with a single server
• Scheduling a single server and equal processing times in a two-machine flow-shop
• Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times
• Two-machine flow shop problems with a single server
• The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
• Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
• Unrelated parallel machine scheduling with new criteria: complexity and models
• Scheduling jobs with equal processing times and a single server on parallel identical machines
• Two-machine flow-shop scheduling problems with minimizing the total completion times
• A survey of scheduling problems with setup times or costs
• Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic
• Minimizing flowtime for paired tasks

This page was built for publication: Scheduling a single server in a two-machine flow shop

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