A Systematic Literature Review on No-Idle Flow Shop Scheduling Problem
Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
Authors
Journals
Cited by 1 publication
References 81 publications
Listing all delta partitions of a given set: Algorithm design and results
Let α \alpha be a set of n n elements and δ \delta be a nonnegative integer. A δ \delta -partition of α \alpha is a set of pairwise disjoint nonempty subsets of α \alpha such that the union of the subsets is equal to α \alpha and every subset has a size greater than δ \delta . We formulate an algorithm for computing all δ \delta -partitions of a given n n -element set and show that the algorithm runs in O ( n ) {\mathcal{O}}\left(n) space and O ( n ) {\mathcal{O}}\left(n) delay time between any two successive outputs of δ \delta -partitions of the given set. An application of the notion of δ \delta -partitions is illustrated in the following scheduling problem. Suppose a factory has n n machines and m ≤ n m\le n jobs to complete daily. Every job can be accomplished by operating at least δ + 1 \delta +1 machines. A machine cannot work on multiple jobs simultaneously. According to a utilization policy of the factory’s management, no machine is allowed to be idle, so all machines should be running on some job. Find a daily schedule of the factory’s machines satisfying all the mentioned constraints. Let α \alpha be the set of the factory’s machines. Then, an α \alpha ’s δ \delta -partition with m m subsets is a legal schedule if every subset (in the δ \delta -partition) includes exclusively δ + 1 \delta +1 or more machines that run on the same job.
Listing all delta partitions of a given set: Algorithm design and results
Let α \alpha be a set of n n elements and δ \delta be a nonnegative integer. A δ \delta -partition of α \alpha is a set of pairwise disjoint nonempty subsets of α \alpha such that the union of the subsets is equal to α \alpha and every subset has a size greater than δ \delta . We formulate an algorithm for computing all δ \delta -partitions of a given n n -element set and show that the algorithm runs in O ( n ) {\mathcal{O}}\left(n) space and O ( n ) {\mathcal{O}}\left(n) delay time between any two successive outputs of δ \delta -partitions of the given set. An application of the notion of δ \delta -partitions is illustrated in the following scheduling problem. Suppose a factory has n n machines and m ≤ n m\le n jobs to complete daily. Every job can be accomplished by operating at least δ + 1 \delta +1 machines. A machine cannot work on multiple jobs simultaneously. According to a utilization policy of the factory’s management, no machine is allowed to be idle, so all machines should be running on some job. Find a daily schedule of the factory’s machines satisfying all the mentioned constraints. Let α \alpha be the set of the factory’s machines. Then, an α \alpha ’s δ \delta -partition with m m subsets is a legal schedule if every subset (in the δ \delta -partition) includes exclusively δ + 1 \delta +1 or more machines that run on the same job.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
Contact Info
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Product
Resources
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.
