WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Journal of Applied Mathematics and Computing
  2. Journal of Applied Mathematics and Computing : Volume 20
  3. Journal of Applied Mathematics and Computing : Volume 20, Issue 1-2, January 2006
  4. Complexity of the scheduling languageRSV
Loading...

Please wait, while we are loading the content...

Journal of Applied Mathematics and Computing : Volume 54
Journal of Applied Mathematics and Computing : Volume 53
Journal of Applied Mathematics and Computing : Volume 52
Journal of Applied Mathematics and Computing : Volume 51
Journal of Applied Mathematics and Computing : Volume 50
Journal of Applied Mathematics and Computing : Volume 49
Journal of Applied Mathematics and Computing : Volume 48
Journal of Applied Mathematics and Computing : Volume 47
Journal of Applied Mathematics and Computing : Volume 46
Journal of Applied Mathematics and Computing : Volume 45
Journal of Applied Mathematics and Computing : Volume 44
Journal of Applied Mathematics and Computing : Volume 43
Journal of Applied Mathematics and Computing : Volume 42
Journal of Applied Mathematics and Computing : Volume 41
Journal of Applied Mathematics and Computing : Volume 40
Journal of Applied Mathematics and Computing : Volume 39
Journal of Applied Mathematics and Computing : Volume 38
Journal of Applied Mathematics and Computing : Volume 37
Journal of Applied Mathematics and Computing : Volume 36
Journal of Applied Mathematics and Computing : Volume 35
Journal of Applied Mathematics and Computing : Volume 34
Journal of Applied Mathematics and Computing : Volume 33
Journal of Applied Mathematics and Computing : Volume 32
Journal of Applied Mathematics and Computing : Volume 31
Journal of Applied Mathematics and Computing : Volume 30
Journal of Applied Mathematics and Computing : Volume 29
Journal of Applied Mathematics and Computing : Volume 28
Journal of Applied Mathematics and Computing : Volume 27
Journal of Applied Mathematics and Computing : Volume 26
Journal of Applied Mathematics and Computing : Volume 25
Journal of Applied Mathematics and Computing : Volume 24
Journal of Applied Mathematics and Computing : Volume 23
Journal of Applied Mathematics and Computing : Volume 22
Journal of Applied Mathematics and Computing : Volume 21
Journal of Applied Mathematics and Computing : Volume 20
Journal of Applied Mathematics and Computing : Volume 20, Issue 1-2, January 2006
The perturbation bounds for the solution of weighted kronecker product linear systems using thew-weighted drazin inverse
Determination of the flexural rigidity of a beam from limited boundary measurements
Condition number for the w-weighted drazin inverse and its applications in the solution of rectangular linear system
On integral graphs which belong to the class $$\overline {\alpha K_{a,a} \cup \beta {\rm K}_{b,b} } $$
On a permutablity problem for groups
Solving systems of equivalentions
Stochastic activity networks with truncated exponential activity times
Oscillation criteria for nonlinear perturbed dynamic equations of second-order on time scales
Circular list colorings of some graphs
Approximation by fuzzy B-spline series
Fibonacci lengths involving the wall number k(n)
Complexity of the scheduling languageRSV
Propagation of surface waves on irregular bed topography
The layout problem of two kinds of graph elements with performance constraints and its optimality conditions
On the restricted convergence of generalized extreme order statistics
Convergence of descent method with new line search
On properties of fuzzy hyperideals in hypernear-rings with t-Norms
A Reverse of bessel’s inequality in 2-inner product spaces and some grüss type related results with applications
Milp modelling for time optimal guidance to a moving target
Oscillation of sublinear difference equations with positive neutral term
Intuitionistic fuzzy finite switchboard state machines
Multi-item shelf-space allocation of breakable items via genetic algorithm
A canonical representation for the solution of fuzzy linear system and fuzzy linear programming problem
Oscillation of second order unstable neutral difference equations with continuous arguments
Iterative algorithms with errors for zeros of accretive operators in banach spaces
Optimization model and algorithm of the trajectory of horizontal well with perturbation
Some results on fixed points in the fuzzy metric space
Lattice of Keychains
The equivalent form of a matrix inequality and its application
Application of fuzzy logic in the classical cellular automata model
A solution of the ornstein-uhlenbeck equation
Interval-valued fuzzy ideals generated by an interval-valued fuzzy subset in semigroups
Convergence and stability of three-step iterative scheme with errors for completely generalized strongly nonlinear quasivariational inequalities
On the equationf’’’ +f f’’ + λ(1 -f’$^{2}$)= 0 with λ ≤ -1/2 arising in boundary layer theory
Journal of Applied Mathematics and Computing : Volume 19
Journal of Applied Mathematics and Computing : Volume 18
Journal of Applied Mathematics and Computing : Volume 17
Journal of Applied Mathematics and Computing : Volume 16
Journal of Applied Mathematics and Computing : Volume 15
Journal of Applied Mathematics and Computing : Volume 14
Journal of Applied Mathematics and Computing : Volume 13
Journal of Applied Mathematics and Computing : Volume 12
Journal of Applied Mathematics and Computing : Volume 11
Journal of Applied Mathematics and Computing : Volume 10
Journal of Applied Mathematics and Computing : Volume 9
Journal of Applied Mathematics and Computing : Volume 8
Journal of Applied Mathematics and Computing : Volume 7
Journal of Applied Mathematics and Computing : Volume 6
Journal of Applied Mathematics and Computing : Volume 5
Journal of Applied Mathematics and Computing : Volume 4

Similar Documents

...
All-shortest-path 2-interval routing is NP-complete

Article

...
Single-machine scheduling problems with an aging effect

Article

...
Single machine scheduling problems with position-dependent processing times

Article

...
The Computational Complexity of Motion Planning

Article

...
Single machine scheduling problem with multiple due windows assignment in a group technology

Article

...
Flow shop scheduling with effects of learning and deterioration

Article

...
PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability

Article

...
A thirty Year old conjecture about promise problems

Article

...
Single machine group scheduling under decreasing linear deterioration

Article

Complexity of the scheduling languageRSV

Content Provider Springer Nature Link
Author Kim, Pok Son Kutzner, Arne Park, Taehoon
Copyright Year 2006
Abstract Resource-constrained project scheduling problems with variant processes can be represented and solved using a logic-based terminological language calledRSV r esource constrained project s cheduling with v ariant processes). We consider three different variants for formalizing theRSV-scheduling problem, theoptimizing variant, thenumber variant and thedecision variant. Using the decision variant we show that theRSV problem is NP-complete. Further we show that the optimizing variant (or number variant) of theRSV-problem is computable in polynomial time iff. the decision variant is computable in polynomial time.
Starting Page 181
Ending Page 195
Page Count 15
File Format PDF
ISSN 15985865
Journal Journal of Applied Mathematics and Computing
Volume Number 20
Issue Number 1-2
e-ISSN 18652085
Language English
Publisher Springer-Verlag
Publisher Date 2006-01-01
Publisher Place Berlin, Heidelberg
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword Scheduling problem NP-completeness description logic Computational difficulty of problems Scheduling theory, deterministic Knowledge representation Computational Mathematics and Numerical Analysis ApplicationMathematics/Computational Methods of Engineering Theory of Computation Mathematics of Computing
Content Type Text
Resource Type Article
Subject Applied Mathematics Computational Mathematics
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
I will try my best to help you...
Cite this Content
Loading...