Shop scheduling problems with pliable jobs

DOI10.1007/S10951-019-00607-9MaRDI QIDQ2294890zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 12 February 2020

Published in Journal of Scheduling (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10951-019-00607-9

zbMATH Keywords

flow shopidentical parallel machinesopen shoppreemptionscheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Synchronous flow shop scheduling with pliable jobs
• Short Shop Schedules
• scientific article; zbMATH DE number 3860868
• The complexity of shop-scheduling problems with two or three jobs
• Flow shop scheduling with flexible processing times

Cites work

• A framework for the complexity of high-multiplicity scheduling problems
• A note on the influence of missing operations on scheduling problems
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• An Algorithm for Large Zero-One Knapsack Problems
• Basic Techniques for Lot Streaming
• Design and operation of dynamic assembly lines using work-sharing
• Dynamic task assignment for throughput maximization with worksharing
• Flow shop scheduling with flexible processing times
• scientific article; zbMATH DE number 3883931 (Why is no real title available?)
• scientific article; zbMATH DE number 3873052 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
• Minimizing total weighted completion time in a proportionate flow shop
• New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
• Open Shop Scheduling to Minimize Finish Time
• Optimal two- and three-stage production schedules with set-up time included
• Permutation vs. non-permutation flow shop schedules
• Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
• Preemptive Scheduling with Due Dates
• Scheduling algorithms
• Scheduling Jobs on Several Machines with the Job Splitting Property
• Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
• Scheduling with deadlines and loss functions
• Scheduling. Theory, algorithms, and systems
• Sequencing and scheduling in flowshops with task redistribution
• Synchronous flow shop scheduling with pliable jobs
• The Complexity of Flowshop and Jobshop Scheduling
• The three-machine proportionate open shop and mixed shop minimum makespan problems
• Throughput optimization in two-machine flowshops with flexible operations
• Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence

Cited in

(11)

• Practical job shop scheduling
• Multi-resource shop scheduling with resource flexibility
• Reversible-shop scheduling
• Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Exact solution of the two-machine flow shop problem with three operations
• A grasp for job shop scheduling
• Scheduling job shops with delays
• scientific article; zbMATH DE number 4099024 (Why is no real title available?)
• Flow shop scheduling with inter-stage flexibility and blocking constraints
• Synchronous flow shop scheduling with pliable jobs

This page was built for publication: Shop scheduling problems with pliable jobs

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